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

DOI10.1016/J.EJC.2024.104075MaRDI QIDQ6655697FDOQ6655697

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)

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

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)

Cites Work

• Complement reducible graphs
• Efficient testing of large graphs
• On universality of graphs with uniformly distributed edges
• Induced Ramsey-type theorems
• Ramsey-type theorems
• Graph removal lemmas
• Title not available (Why is that?)
• Ramsey-type theorems with forbidden subgraphs
• Edge Distribution of Graphs with Few Copies of a Given Graph
• Title not available (Why is that?)
• Easily testable graph properties
• 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)