The critical window for the classical Ramsey-Turán problem
Ramsey-Turán result proved by Szemerédi in 1972: any K [subscript 4-]free graph on n vertices with independence number o(n) has at most (1[over]8+o(1))n[superscript 2] edges. Four years later, Bollobás and Erdős gave a surprising geometric construction, utilizing the isoperimetric inequality for th...
Glavni autori: | Fox, Jacob, Loh, Po-Shen, Zhao, Yufei |
---|---|
Daljnji autori: | Massachusetts Institute of Technology. Department of Mathematics |
Format: | Članak |
Jezik: | en_US |
Izdano: |
Springer-Verlag/Bolyai Society
2015
|
Online pristup: | http://hdl.handle.net/1721.1/92864 |
Slični predmeti
-
On vertex-induced weighted Turán problems
od: Xu, Z, i dr.
Izdano: (2021) -
On two problems in graph Ramsey theory
od: Conlon, David, i dr.
Izdano: (2012) -
On two problems in graph Ramsey theory
od: Conlon, D, i dr.
Izdano: (2012) -
Two extensions of Ramsey’s theorem
od: Conlon, David, i dr.
Izdano: (2015) -
On the grid Ramsey problem and related questions
od: Conlon, D, i dr.
Izdano: (2014)