Induced subgraph density. II: Sparse and dense sets in cographs

DOI10.1016/J.EJC.2024.104075MaRDI QIDQ6655697FDO

Authors Jacob Fox, Tung Nguyen, Alex Scott, Paul Seymour

Publication date 27 December 2024

Published in European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

cographsgood graphsFox-Sudakov conjecture

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Recommendations

• On Rödl's theorem for cographs
• Induced subgraph density. I: A loglog step towards Erdős-Hajnal
• Graphs in which each \(C_4\) spans \(K_4\)
• A further extension of Rödl's theorem
• Strengthening Rödl's theorem

Cites work

• scientific article; zbMATH DE number 3628985 (Why is no real title available?)
• scientific article; zbMATH DE number 850070 (Why is no real title available?)
• Complement reducible graphs
• Easily testable graph properties
• Edge Distribution of Graphs with Few Copies of a Given Graph
• Efficient testing of large graphs
• Graph removal lemmas
• Induced Ramsey-type theorems
• On universality of graphs with uniformly distributed edges
• Ramsey-type theorems
• Ramsey-type theorems with forbidden subgraphs
• Strengthening Rödl's theorem

Cited in

(1)

• On Rödl's theorem for cographs

This page was built for publication: Induced subgraph density. II: Sparse and dense sets in cographs

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