On Rödl's theorem for cographs

DOI10.37236/12189MaRDI QIDQ6197319zbMATH OpenOpenAlexFDO

Authors Lior Gishboliner, Asaf Shapira

Publication date 16 February 2024

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

Erdős-Hajnal property

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Structural characterization of families of graphs (05C75)

Recommendations

• Induced subgraph density. II: Sparse and dense sets in cographs
• Strengthening Rödl's theorem
• A further extension of Rödl's theorem
• Induced subgraph density. I: A loglog step towards Erdős-Hajnal
• Dense \(H\)-free graphs are almost \((\chi (H)-1)\)-partite

Cites work

• Easily testable graph properties

Cited in

(2)

• Induced subgraph density. VI: Bounded VC-dimension
• Induced subgraph density. II: Sparse and dense sets in cographs

This page was built for publication: On Rödl's theorem for cographs

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