Abstract
Recently, Rödl and Ruciński [5,6] proved the following threshold result about Ramsey properties of random graphs. Let K( n, p) be the binomial random graph obtained from the complete graph K( n) by independent deletion of each edge with probability 1 - p. We write F → ( G) r if for every r-coloring of the edges of F there is a monochromatic copy of G.
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.
