Abstract
AbstractWe prove that for every r ⩾ 2 there is C > 0 such that if p Cn−1/2 then almost surely every r‐coloring of the edges of the binomial random graph K(n, p) results in a monochromatic triangle. © 1994 John Wiley & Sons, Inc.
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.
