Abstract
Let P be a non-trivial hereditary property of graphs and let k be the minimum chromatic number of a graph that does not belong to P. We prove that, for every fixed p∈(0,1), the maximum possible number of edges in a subgraph of the random graph G(n,p) which belongs to P is, with high probability,(1−1k−1+o(1))p(n2).
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.
