Abstract
AbstractWe say that if, in every edge coloring , we can find either a 1‐colored copy of or a 2‐colored copy of . The well‐known Kohayakawa‐Kreuter conjecture states that the threshold for the property is equal to , where is given by for any pair of graphs and with . In this article, we show the 0‐statement of the Kohayakawa–Kreuter conjecture for every pair of cycles and cliques.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
