Skip to main content Accessibility help
×
Home

SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS

  • LUCA GUGELMANN (a1), RAJKO NENADOV (a2), YURY PERSON (a3), NEMANJA ŠKORIĆ (a1), ANGELIKA STEGER (a1) and HENNING THOMAS (a1)...

Abstract

A celebrated result of Rödl and Ruciński states that for every graph $F$ , which is not a forest of stars and paths of length 3, and fixed number of colours $r\geqslant 2$ there exist positive constants $c,C$ such that for $p\leqslant cn^{-1/m_{2}(F)}$ the probability that every colouring of the edges of the random graph $G(n,p)$ contains a monochromatic copy of $F$ is $o(1)$ (the ‘0-statement’), while for $p\geqslant Cn^{-1/m_{2}(F)}$ it is $1-o(1)$ (the ‘1-statement’). Here $m_{2}(F)$ denotes the 2-density of $F$ . On the other hand, the case where $F$ is a forest of stars has a coarse threshold which is determined by the appearance of a certain small subgraph in $G(n,p)$ . Recently, the natural extension of the 1-statement of this theorem to $k$ -uniform hypergraphs was proved by Conlon and Gowers and, independently, by Friedgut, Rödl and Schacht. In particular, they showed an upper bound of order $n^{-1/m_{k}(F)}$ for the 1-statement, where $m_{k}(F)$ denotes the $k$ -density of $F$ . Similarly as in the graph case, it is known that the threshold for star-like hypergraphs is given by the appearance of small subgraphs. In this paper we show that another type of threshold exists if $k\geqslant 4$ : there are $k$ -uniform hypergraphs for which the threshold is determined by the asymmetric Ramsey problem in which a different hypergraph has to be avoided in each colour class. Along the way we obtain a general bound on the 1-statement for asymmetric Ramsey properties in random hypergraphs. This extends the work of Kohayakawa and Kreuter, and of Kohayakawa, Schacht and Spöhel who showed a similar result in the graph case. We prove the corresponding 0-statement for hypergraphs satisfying certain balancedness conditions.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS
      Available formats
      ×

Copyright

This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.

References

Hide All
[1] Alon, N. and Spencer, J. H., The Probabilistic Method (John Wiley & Sons, 2015).
[2] Balogh, J., Morris, R. and Samotij, W., ‘Independent sets in hypergraphs’, J. Amer. Math. Soc. 28(3) (2015), 669709.
[3] Bollobás, B., ‘Threshold functions for small subgraphs’, Math. Proc. Cambridge Philos. Soc. 90(2) (1981), 197206.
[4] Conlon, D., Dellamonica, D. Jr., La Fleur, S., Rödl, V. and Schacht, M., ‘A note on induced Ramsey numbers’, Preprint (2016), arXiv:1601.01493, https://link.springer.com/chapter/10.1007/978-3-319-44479-6_13.
[5] Conlon, D. and Gowers, W. T., ‘Combinatorial theorems in sparse random sets’, Ann. of Math. (2) 184 (2016), 367454.
[6] Conlon, D., Gowers, W. T., Samotij, W. and Schacht, M., ‘On the KŁR conjecture in random graphs’, Israel J. Math. 203(1) (2014), 535580.
[7] Friedgut, E., ‘Hunting for sharp thresholds’, Random Structures Algorithms 26(1–2) (2005), 3751.
[8] Friedgut, E., Hàn, H., Person, Y. and Schacht, M., ‘A sharp threshold for van der Waerden’s theorem in random subsets’, Discrete Analysis 7 (2016), 20.
[9] Friedgut, E. and Krivelevich, M., ‘Sharp thresholds for certain Ramsey properties of random graphs’, Random Structures Algorithms 17(1) (2000), 119.
[10] Friedgut, E., Rödl, V., Ruciński, A. and Tetali, P., ‘A sharp threshold for random graphs with a monochromatic triangle in every edge coloring’, Mem. Amer. Math. Soc. 179(845) (2006), 66.
[11] Friedgut, E., Rödl, V. and Schacht, M., ‘Ramsey properties of random discrete structures’, Random Structures Algorithms 37(4) (2010), 407436.
[12] Janson, S., Łuczak, T. and Ruciński, A., Random Graphs (Wiley, New York, 2000).
[13] Kohayakawa, Y. and Kreuter, B., ‘Threshold functions for asymmetric Ramsey properties involving cycles’, Random Structures Algorithms 11(3) (1997), 245276.
[14] Kohayakawa, Y., Schacht, M. and Spöhel, R., ‘Upper bounds on probability thresholds for asymmetric ramsey properties’, Random Structures Algorithms 44(1) (2014), 128.
[15] Łuczak, T., Ruciński, A. and Voigt, B., ‘Ramsey properties of random graphs’, J. Combin. Theory Ser. B 56(1) (1992), 5568.
[16] Marciniszyn, M., Skokan, J., Spöhel, R. and Steger, A., ‘Asymmetric Ramsey properties of random graphs involving cliques’, Random Structures Algorithms 34(4) (2009), 419453.
[17] Nenadov, R., Person, Y., Škorić, N. and Steger, A., ‘An algorithmic framework for obtaining lower bounds for random Ramsey problems’, J. Combin. Theory Ser. B 124 (2017), 138.
[18] Nenadov, R. and Steger, A., ‘A short proof of the random Ramsey theorem’, Combin. Probab. Comput. 25(01) (2016), 130144.
[19] Nenadov, R., Steger, A. and Stojaković, M., ‘On the threshold for the Maker–Breaker H-game’, Random Structures Algorithms 49(3) (2016), 558578.
[20] Rödl, V. and Ruciński, A., ‘Lower bounds on probability thresholds for Ramsey properties’, inCombinatorics, Paul Erdős is eighty, 1, Vol. 1, Bolyai Society Mathematical Studies (János Bolyai Mathematical Society, 1993), 317346.
[21] Rödl, V. and Ruciński, A., ‘Random graphs with monochromatic triangles in every edge coloring’, Random Structures Algorithms 5(2) (1994), 253270.
[22] Rödl, V. and Ruciński, A., ‘Threshold functions for Ramsey properties’, J. Amer. Math. Soc. 8(4) (1995), 917942.
[23] Rödl, V. and Ruciński, A., ‘Ramsey properties of random hypergraphs’, J. Combin. Theory Ser. A 81(1) (1998), 133.
[24] Rödl, V., Ruciński, A. and Schacht, M., ‘Ramsey properties of random k-partite, k-uniform hypergraphs’, SIAM J. Discrete Math. 21(2) (2007), 442460.
[25] Rödl, V., Ruciński, A. and Schacht, M., ‘An exponential-type upper bound for Folkman numbers’, Combinatorica 37(4) (2017), 767784.
[26] Saxton, D. and Thomason, A., ‘Hypergraph containers’, Invent. Math. 201(3) (2015), 925992.
[27] Schacht, M. and Schulenburg, F., ‘Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs’, Random Structures Algorithms Preprint (2016), arXiv:1602.02501.
[28] Thomas, H., ‘Aspects of games on random graphs’, PhD Thesis, ETH Zurich, 2013.
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

MSC classification

Related content

Powered by UNSILO

SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS

  • LUCA GUGELMANN (a1), RAJKO NENADOV (a2), YURY PERSON (a3), NEMANJA ŠKORIĆ (a1), ANGELIKA STEGER (a1) and HENNING THOMAS (a1)...

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.