Papers
Topics
Authors
Recent
Search
2000 character limit reached

Off-Diagonal Ramsey Multiplicity

Published 30 Jun 2023 in math.CO and cs.DM | (2306.17388v1)

Abstract: The Ramsey multiplicity problem asks for the minimum asymptotic density of monochromatic labelled copies of a graph $H$ in a red/blue colouring of the edges of $K_n$. We introduce an off-diagonal generalization in which the goal is to minimize a certain weighted sum of the densities of red copies of one graph and blue copies of another. We build up various properties of this new notion, including a useful "dual formulation," and use these results to solve the problem for several pairs of graphs.

Authors (2)
Definition Search Book Streamline Icon: https://streamlinehq.com
References (38)
  1. A note on Ramsey numbers. J. Combin. Theory Ser. A, 29(3):354–360, 1980.
  2. Common pairs of graphs. E-print arXiv:2208.02045v3, 2023.
  3. Off-diagonal commonality of graphs via entropy. In preparation, 2023.
  4. T. Bohman. The triangle-free process. Adv. Math., 221(5):1653–1677, 2009.
  5. T. Bohman and P. Keevash. Dynamic concentration of the triangle-free process. Random Structures Algorithms, 58(2):221–293, 2021.
  6. D. Conlon. On the Ramsey multiplicity of complete graphs. Combinatorica, 32(2):171–186, 2012.
  7. Recent developments in graph Ramsey theory. In Surveys in combinatorics 2015, volume 424 of London Math. Soc. Lecture Note Ser., pages 49–118. Cambridge Univ. Press, Cambridge, 2015.
  8. D. Conlon and J. Lee. Sidorenko’s conjecture for blow-ups. Discrete Anal., Paper No. 2, 13, 2021.
  9. Monochromatic triangles in three-coloured graphs. J. Combin. Theory Ser. B, 103(4):489–503, 2013.
  10. P. Erdős and M. Simonovits. Cube-supersaturated graphs and related problems. In Progress in graph theory (Waterloo, Ont., 1982), pages 203–218. Academic Press, Toronto, ON, 1984.
  11. C. Even-Zohar and N. Linial. A note on the inducibility of 4-vertex graphs. Graphs Combin., 31(5):1367–1380, 2015.
  12. The triangle-free process and the Ramsey number R⁢(3,k)𝑅3𝑘R(3,k)italic_R ( 3 , italic_k ). Mem. Amer. Math. Soc., 263(1274):v+125, 2020.
  13. J. Fox. There exist graphs with super-exponential Ramsey multiplicity constant. J. Graph Theory, 57(2):89–98, 2008.
  14. J. Fox and Y. Wigderson. Ramsey multiplicity and the Turán coloring. E-print arXiv:2207.07775v1, 2022.
  15. A. W. Goodman. On sets of acquaintances and strangers at any party. Amer. Math. Monthly, 66:778–783, 1959.
  16. On tripartite common graphs. Combin. Probab. Comput., 31(5):907–923, 2022.
  17. Non-three-colourable common graphs exist. Combin. Probab. Comput., 21(5):734–742, 2012.
  18. Multiplicities of subgraphs. Combinatorica, 16(1):123–141, 1996.
  19. J. H. Kim. The Ramsey number R⁢(3,t)𝑅3𝑡R(3,t)italic_R ( 3 , italic_t ) has order of magnitude t2/log⁡tsuperscript𝑡2𝑡t^{2}/\log titalic_t start_POSTSUPERSCRIPT 2 end_POSTSUPERSCRIPT / roman_log italic_t. Random Structures Algorithms, 7(3):173–207, 1995.
  20. S. Ko and J. Lee. Common graphs with arbitrary connectivity and chromatic number. E-print arXiv:2207.09427v1, 2022.
  21. Non-bipartite k𝑘kitalic_k-common graphs. Combinatorica, 42(1):87–114, 2022.
  22. Common graphs with arbitrary chromatic number. E-print arXiv:2206.05800v1, 2022.
  23. Disconnected common graphs via supersaturation. E-print arXiv:2303.09296v1, 2023.
  24. L. Lovász. Large networks and graph limits, volume 60 of American Mathematical Society Colloquium Publications. American Mathematical Society, Providence, RI, 2012.
  25. L. Lovász and B. Szegedy. Limits of dense graph sequences. J. Combin. Theory Ser. B, 96(6):933–957, 2006.
  26. L. Lovász and B. Szegedy. Szemerédi’s lemma for the analyst. Geom. Funct. Anal., 17(1):252–270, 2007.
  27. S. Mattheus and J. Verstraëte. The asymptotics of r⁢(4,t)𝑟4𝑡r(4,t)italic_r ( 4 , italic_t ). E-print arXiv:2306.04007v1, 2023.
  28. S. Nieß. Counting monochromatic copies of K4subscript𝐾4K_{4}italic_K start_POSTSUBSCRIPT 4 end_POSTSUBSCRIPT: a new lower bound for the Ramsey multiplicity problem. E-print arXiv:1207.4714v1, 2012.
  29. New Ramsey multiplicity bounds and search heuristics. E-print arXiv:2206.04036v1, 2022.
  30. S. P. Radziszowski. Small Ramsey numbers. Electron. J. Combin., 1:Dynamic Survey 1, 30, 1994.
  31. F. P. Ramsey. On a Problem of Formal Logic. Proc. Lond. Math. Soc. (2), 30(4):264–286, 1929.
  32. A. A. Razborov. Flag algebras. J. Symbolic Logic, 72(4):1239–1282, 2007.
  33. J. B. Shearer. A note on the independence number of triangle-free graphs. Discrete Math., 46(1):83–87, 1983.
  34. A. F. Sidorenko. Cycles in graphs and functional inequalities. Mat. Zametki, 46(5):72–79, 104, 1989.
  35. A. F. Sidorenko. A correlation inequality for bipartite graphs. Graphs Combin., 9(2):201–204, 1993.
  36. K. Sperfeld. On the minimal monochromatic K4subscript𝐾4K_{4}italic_K start_POSTSUBSCRIPT 4 end_POSTSUBSCRIPT-density. E-print arXiv:1106.1030v4, 2011.
  37. A. Thomason. A disproof of a conjecture of Erdős in Ramsey theory. J. Lond. Math. Soc. (2), 39(2):246–255, 1989.
  38. A. Thomason. Graph products and monochromatic multiplicities. Combinatorica, 17(1):125–134, 1997.
Citations (2)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now