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)