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

DOI10.1016/j.ejc.2024.104075MaRDI QIDQ6655697

Alexander D. Scott, Tung Nguyen, P. D. Seymour, Jacob Fox

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Ramsey-type theorems
• On universality of graphs with uniformly distributed edges
• Complement reducible graphs
• Graph removal lemmas
• Edge Distribution of Graphs with Few Copies of a Given Graph
• Easily Testable Graph Properties
• Induced Ramsey-type theorems
• Efficient testing of large graphs
• Ramsey-type theorems with forbidden subgraphs
• Strengthening Rödl's theorem

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