Excluding paths and antipaths

DOI10.1007/s00493-014-3000-zzbMath1374.05136OpenAlexW2093711979MaRDI QIDQ520043

Maria Chudnovsky, P. D. Seymour

Publication date: 31 March 2017

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-014-3000-z

zbMATH Keywords

Erdős-Hajnal conjectureantipaths

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (7)

Excluding hooks and their complements ⋮ Towards the Erdős-Hajnal conjecture for \(P_5\)-free graphs ⋮ Erdős-Hajnal for cap-free graphs ⋮ Pure pairs. II: Excluding all subdivisions of a graph ⋮ The Erdös--Hajnal Conjecture for Long Holes and Antiholes ⋮ The Erdős-Hajnal conjecture for paths and antipaths ⋮ The Erdös-Hajnal Conjecture-A Survey

Cites Work

• Ramsey-type theorems
• The strong perfect graph theorem
• The Erdős-Hajnal conjecture for bull-free graphs
• The Erdős-Hajnal conjecture for paths and antipaths
• Normal hypergraphs and the perfect graph conjecture
• Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement
• Some remarks on the theory of graphs
• Ramsey-type theorems with forbidden subgraphs
• Unnamed Item

This page was built for publication: Excluding paths and antipaths