×The system will be going down for regular maintenance. Please save your work and logout.
Metadata only
Date
2021-08Type
- Journal Article
ETH Bibliography
yes
Altmetrics
Abstract
We study the following question raised by Erdos and Hajnal in the early 90's. Over all n-vertex graphs G what is the smallest possible value of m for which any m vertices of G contain both a clique and an independent set of size log n? We construct examples showing that m is at most 2(2(log log n)1/2+o(1)) obtaining a twofold sub-polynomial improvement over the upper bound of about root n coming from the natural guess, the random graph. Our (probabilistic) construction gives rise to new examples of Ramsey graphs, which while having no very large homogenous subsets contain both cliques and independent sets of size log n in any small subset of vertices. This is very far from being true in random graphs. Our proofs are based on an interplay between taking lexicographic products and using randomness. Show more
Publication status
publishedExternal links
Journal / series
Proceedings of the American Mathematical SocietyVolume
Pages / Article No.
Publisher
American Mathematical SocietyOrganisational unit
03993 - Sudakov, Benjamin / Sudakov, Benjamin
Funding
196965 - Problems in Extremal and Probabilistic Combinatorics (SNF)
More
Show all metadata
ETH Bibliography
yes
Altmetrics