The exact minimum number of triangles in graphs with given order and size
What is the minimum number of triangles in a graph of given order and size? Motivated by earlier results of Mantel and Turán, Rademacher solved the first nontrivial case of this problem in 1941. The problem was revived by Erdős in 1955; it is now known as the Erdős–Rademacher problem. After attracti...
主要な著者: | Liu, H, Pikhurko, O, Staden, K |
---|---|
フォーマット: | Journal article |
言語: | English |
出版事項: |
Cambridge University Press
2020
|
類似資料
-
THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE
著者:: HONG LIU, 等
出版事項: (2020-01-01) -
Minimum number of additive tuples in groups of prime order
著者:: Chervak, O, 等
出版事項: (2019) -
On the minimum spectral radius of connected graphs of given order and size
著者:: Cioaba Sebastian M., 等
出版事項: (2024-09-01) -
The Number of Blocks of a Graph with Given Minimum Degree
著者:: Lei Li, 等
出版事項: (2021-01-01) -
Exact solutions to the Erdős-Rothschild problem
著者:: Oleg Pikhurko, 等
出版事項: (2024-01-01)