Abstract
A graph on n vertices is said to be C-Ramsey if every clique or independent set of the graph has size at most C logn. The only known constructions of Ramsey graphs are probabilistic in nature, and it is generally believed that such graphs possess many of the same properties as dense random graphs. Here, we demonstrate one such property: for any fixed C > 0, every C-Ramsey graph on n vertices induces subgraphs of at least n2-o(1) distinct sizes. This near-optimal result is closely related to two unresolved conjectures, the first due to Erdős and McKay and the second due to Erdős, Faudree and Sós, both from 1992.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. Alon, J. Balogh, A. Kostochka and W. Samotij: Sizes of induced subgraphs of Ramsey graphs, Combin. Probab. Comput. 18 (2009), 459–476.
N. Alon and A. Kostochka: Induced subgraphs with distinct sizes, Random Structures Algorithms 34 (2009), 45–53.
N. Alon, M. Krivelevich and B. Sudakov: Induced subgraphs of prescribed size, J. Graph Theory 43 (2003), 239–251.
N. Alon and J. H. Spencer: The probabilistic method, 3rd ed., Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Inc., Hoboken, NJ, 2008.
B. Barak, A. Rao, T. Shaltiel and A. Wigderson: 2-source dispersers for no(1) entropy, and Ramsey graphs beating the Frankl-Wilson construction, Ann. of Math. 176 (2012), 1483–1543.
B. Bukh and B. Sudakov: Induced subgraphs of Ramsey graphs with many distinct degrees, J. Combin. Theory Ser. B 97 (2007), 612–619.
P. Erdős: Some remarks on the theory of graphs, Bull. Amer. Math. Soc. 53 (1947), 292–294.
P. Erdős and G. Szekeres: A combinatorial problem in geometry, Compositio Math. 2 (1935), 463–470.
P. Erdős: Some of my favourite problems in various branches of combinatorics, Matematiche (Catania) 47 (1992), 231–240.
P. Erdős: Some recent problems and results in graph theory, Discrete Math. 164 (1997), 81–85.
P. Erdős and A. Szemerédi: On a Ramsey type theorem, Period. Math. Hungar. 2 (1972), 295–299.
P. Frankl and R. M. Wilson: Intersection theorems with geometric consequences, Combinatorica 1 (1981), 357–368.
W. Hoeffding: Probability inequalities for sums of bounded random variables, J. Amer. Statist. Assoc. 58 (1963), 13–30.
H. J. Prömel and V. Rödl: Non-Ramsey graphs are c logn-universal, J. Combin. Theory Ser. A 88 (1999), 379–384.
F. P. Ramsey: On a problem of formal logic, Proc. London Math. Soc. 30 (1930), 264–286.
S. Shelah: Erdős and Rényi conjecture, J. Combin. Theory Ser. A 82 (1998), 179–185.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Narayanan, B., Sahasrabudhe, J. & Tomon, I. Ramsey Graphs Induce Subgraphs of Many Different Sizes. Combinatorica 39, 215–237 (2019). https://doi.org/10.1007/s00493-017-3755-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-017-3755-0