Abstract
For graphs G and H, let G⟶kH signify that any k-edge coloring of G contains a monochromatic H as a subgraph. Let G(K2(N),p) be random graph spaces with edge probability p, where K2(N) is the complete N×N bipartite graph. Let C2n be a cycle of length 2n and let k=2,3. It is shown for any ϵ>0, there exists T=T(ϵ)>0 such that if np>T, then Pr[G(K2((k+ϵ)n),p)⟶kC2n]→1 as n→∞, for which the proof relies heavily on the sparse regularity lemma for multipartite graphs.
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.
