@article{c7129ce15fa64fdf8540d163aaef4596,
title = "Largest subgraph from a hereditary property in a random graph",
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.",
keywords = "Hereditary property, Random graphs, Subgraphs",
author = "Noga Alon and Michael Krivelevich and Wojciech Samotij",
note = "Publisher Copyright: {\textcopyright} 2023 Elsevier B.V.",
year = "2023",
month = sep,
doi = "10.1016/j.disc.2023.113480",
language = "אנגלית",
volume = "346",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier B.V.",
number = "9",
}