Towards the Kohayakawa-Kreuter conjecture on asymmetric Ramsey properties
From MaRDI portal
Publication:4993115
DOI10.1017/S0963548320000267zbMATH Open1466.05214arXiv1808.05070OpenAlexW3037246272WikidataQ123196157 ScholiaQ123196157MaRDI QIDQ4993115FDOQ4993115
Authors: Frank Mousset, Rajko Nenadov, Wojciech Samotij 
Publication date: 15 June 2021
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Abstract: For fixed graphs , we prove an upper bound on the threshold function for the property that . This establishes the -statement of a conjecture of Kohayakawa and Kreuter.
Full work available at URL: https://arxiv.org/abs/1808.05070
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hypergraph containers
- Independent sets in hypergraphs
- New versions of Suen's correlation inequality
- On \(K^ 4\)-free subgraphs of random graphs
- On the KŁR conjecture in random graphs
- Threshold Functions for Ramsey Properties
- Title not available (Why is that?)
- Large triangle-free subgraphs in graphs without \(K_ 4\)
- A sharp threshold for random graphs with a monochromatic triangle in every edge coloring
- Title not available (Why is that?)
- Random graphs with monochromatic triangles in every edge coloring
- Ramsey properties of random graphs
- Title not available (Why is that?)
- A short proof of the random Ramsey theorem
- An algorithmic framework for obtaining lower bounds for random Ramsey problems
- Sharp thresholds for certain Ramsey properties of random graphs
- Symmetric and asymmetric Ramsey properties in random hypergraphs
- Upper bounds on probability thresholds for asymmetric Ramsey properties
- Independent sets in hypergraphs and Ramsey properties of graphs and the integers
- The method of hypergraph containers
- Asymmetric Ramsey properties of random graphs involving cliques
- Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs
Cited In (12)
- Ramsey Equivalence for Asymmetric Pairs of Graphs
- Ramsey games near the critical threshold
- Vertex Ramsey properties of randomly perturbed graphs
- Towards the 0-statement of the Kohayakawa-Kreuter conjecture
- On the use of senders for asymmetric tuples of cliques in Ramsey theory
- Independent sets in hypergraphs and Ramsey properties of graphs and the integers
- An asymmetric random Rado theorem for single equations: The 0‐statement
- Asymmetric Ramsey properties of random graphs involving cliques and cycles
- Ramsey goodness of trees in random graphs
- Random Van der Waerden theorem
- An asymmetric random Rado theorem: 1-statement
- Ramsey goodness of clique versus paths in random graphs
This page was built for publication: Towards the Kohayakawa-Kreuter conjecture on asymmetric Ramsey properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993115)
