Advertisement

Ramsey Graphs Induce Subgraphs of Many Different Sizes

  • Bhargav Narayanan
  • Julian Sahasrabudhe
  • István Tomon
Article

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.

Mathematics Subject Classification (2010)

05D10 05C35 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    N. Alon, J. Balogh, A. Kostochka and W. Samotij: Sizes of induced subgraphs of Ramsey graphs, Combin. Probab. Comput. 18 (2009), 459–476.MathSciNetCrossRefzbMATHGoogle Scholar
  2. [2]
    N. Alon and A. Kostochka: Induced subgraphs with distinct sizes, Random Structures Algorithms 34 (2009), 45–53.MathSciNetCrossRefzbMATHGoogle Scholar
  3. [3]
    N. Alon, M. Krivelevich and B. Sudakov: Induced subgraphs of prescribed size, J. Graph Theory 43 (2003), 239–251.MathSciNetCrossRefzbMATHGoogle Scholar
  4. [4]
    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.CrossRefzbMATHGoogle Scholar
  5. [5]
    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.zbMATHGoogle Scholar
  6. [6]
    B. Bukh and B. Sudakov: Induced subgraphs of Ramsey graphs with many distinct degrees, J. Combin. Theory Ser. B 97 (2007), 612–619.MathSciNetCrossRefzbMATHGoogle Scholar
  7. [7]
    P. Erdős: Some remarks on the theory of graphs, Bull. Amer. Math. Soc. 53 (1947), 292–294.MathSciNetCrossRefzbMATHGoogle Scholar
  8. [8]
    P. Erdős and G. Szekeres: A combinatorial problem in geometry, Compositio Math. 2 (1935), 463–470.MathSciNetzbMATHGoogle Scholar
  9. [9]
    P. Erdős: Some of my favourite problems in various branches of combinatorics, Matematiche (Catania) 47 (1992), 231–240.MathSciNetzbMATHGoogle Scholar
  10. [10]
    P. Erdős: Some recent problems and results in graph theory, Discrete Math. 164 (1997), 81–85.MathSciNetCrossRefzbMATHGoogle Scholar
  11. [11]
    P. Erdős and A. Szemerédi: On a Ramsey type theorem, Period. Math. Hungar. 2 (1972), 295–299.MathSciNetCrossRefzbMATHGoogle Scholar
  12. [12]
    P. Frankl and R. M. Wilson: Intersection theorems with geometric consequences, Combinatorica 1 (1981), 357–368.MathSciNetCrossRefzbMATHGoogle Scholar
  13. [13]
    W. Hoeffding: Probability inequalities for sums of bounded random variables, J. Amer. Statist. Assoc. 58 (1963), 13–30.MathSciNetCrossRefzbMATHGoogle Scholar
  14. [14]
    H. J. Prömel and V. Rödl: Non-Ramsey graphs are c logn-universal, J. Combin. Theory Ser. A 88 (1999), 379–384.MathSciNetCrossRefzbMATHGoogle Scholar
  15. [15]
    F. P. Ramsey: On a problem of formal logic, Proc. London Math. Soc. 30 (1930), 264–286.MathSciNetCrossRefzbMATHGoogle Scholar
  16. [16]
    S. Shelah: Erdős and Rényi conjecture, J. Combin. Theory Ser. A 82 (1998), 179–185.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© János Bolyai Mathematical Society and Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  • Bhargav Narayanan
    • 1
  • Julian Sahasrabudhe
    • 2
  • István Tomon
    • 1
  1. 1.Department of Pure Mathematics and Mathematical StatisticsUniversity of CambridgeCambridgeUK
  2. 2.Department of Mathematical SciencesUniversity of MemphisMemphisUSA

Personalised recommendations