Largest subgraph from a hereditary property in a random graph

From MaRDI portal
Publication:6098071

DOI10.1016/J.DISC.2023.113480zbMATH Open1516.05198arXiv2210.12754OpenAlexW4367308549MaRDI QIDQ6098071FDOQ6098071


Authors: Noga Alon, Michael Krivelevich, Wojciech Samotij Edit this on Wikidata


Publication date: 12 June 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/2210.12754




Recommendations




Cites Work


Cited In (4)





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)