Largest subgraph from a hereditary property in a random graph

Noga Alon, Michael Krivelevich*, Wojciech Samotij

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

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.

Original languageEnglish
Article number113480
JournalDiscrete Mathematics
Volume346
Issue number9
DOIs
StatePublished - Sep 2023

Funding

FundersFunder number
USA-Israel BSF2018267
National Science FoundationDMS-2154082
Israel Science Foundation2110/22

    Keywords

    • Hereditary property
    • Random graphs
    • Subgraphs

    Fingerprint

    Dive into the research topics of 'Largest subgraph from a hereditary property in a random graph'. Together they form a unique fingerprint.

    Cite this