Largest subgraph from a hereditary property in a random graph

From MaRDI portal
Publication:6098071




Abstract: We prove that for every non-trivial hereditary family of graphs calP and for every fixed pin(0,1), the maximum possible number of edges in a subgraph of the random graph G(n,p) which belongs to calP is, with high probability, left(1-frac{1}{k-1}+o(1) ight)p{n choose 2}, where k is the minimum chromatic number of a graph that does not belong to calP.









This page was built for publication: Largest subgraph from a hereditary property in a random graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6098071)