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...
Główni autorzy: | Liu, H, Pikhurko, O, Staden, K |
---|---|
Format: | Journal article |
Język: | English |
Wydane: |
Cambridge University Press
2020
|
Podobne zapisy
-
THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE
od: HONG LIU, i wsp.
Wydane: (2020-01-01) -
Minimum number of additive tuples in groups of prime order
od: Chervak, O, i wsp.
Wydane: (2019) -
On the minimum spectral radius of connected graphs of given order and size
od: Cioaba Sebastian M., i wsp.
Wydane: (2024-09-01) -
The Number of Blocks of a Graph with Given Minimum Degree
od: Lei Li, i wsp.
Wydane: (2021-01-01) -
Exact solutions to the Erdős-Rothschild problem
od: Oleg Pikhurko, i wsp.
Wydane: (2024-01-01)