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...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Springer-Verlag/Bolyai Society
2015
|
| Online Access: | http://hdl.handle.net/1721.1/92864 |