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...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer-Verlag/Bolyai Society,
2015-01-14T19:00:04Z.
|
| Subjects: | |
| Online Access: | Get fulltext |