Abstract
In this paper, we study asymmetric Ramsey properties of the random graph . Let and be graphs. We write to denote the property that whenever we colour the edges of with colours from the set there exists and a copy of in monochromatic in colour . There has been much interest in determining the asymptotic threshold function for this property. Rödl and Ruciński determined the threshold function for the general symmetric case; that is, when . A conjecture of Kohayakawa and Kreuter, if true, would fully resolve the asymmetric problem. Recently, the 1-statement of this conjecture was confirmed by Mousset, Nenadov and Samotij. Building on work of Marciniszyn, Skokan, Spöhel and Steger, we reduce the 0-statement of Kohayakawa and Kreuter's conjecture to a certain deterministic subproblem. To demonstrate the potential of this approach, we show this subproblem can be resolved for almost all pairs of regular graphs. This therefore resolves the 0-statement for all such pairs of graphs.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.