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 and for every fixed , the maximum possible number of edges in a subgraph of the random graph which belongs to is, with high probability, left(1-frac{1}{k-1}+o(1)
ight)p{n choose 2}, where is the minimum chromatic number of a graph that does not belong to .
Recommendations
Cites work
Cited in
(5)- The size of a maximum subgraph of the random graph with a given number of edges
- The structure of hereditary properties and colourings of random graphs
- The structure of hereditary properties and 2-coloured multigraphs
- Supersaturation for hereditary properties
- scientific article; zbMATH DE number 3912417 (Why is no real title available?)
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)