Abstract
For graphs G and H, let G→H signify that any red/blue edge coloring of G contains a monochromatic H as a subgraph. Let G(Kk(n),p) be random graph spaces with edge probability p, where Kk(n) is the complete k-partite graph with n vertices in each part. It is shown that if np→∞, then Pr[G(Kk(n),p)→P(k−1−o(1))n]→1 for k=2,3.
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.
