Induced subgraph density. VII: The five-vertex path

DOI10.1112/PLMS.70133MaRDI QIDQ6835684zbMATH OpenFDO

Authors Tung Nguyen, Alex Scott, Paul Seymour

Publication date 30 March 2026

Published in Proceedings of the London Mathematical Society. Third Series (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1112/PLMS.70133

zbMATH Keywords

Erdős-Hajnal conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75) Ramsey theory (05D10)

Cites work

• Crossing patterns of semi-algebraic sets
• Erdős-Hajnal-type results for monotone paths
• Erdős-Hajnal-type results on intersection patterns of geometric objects
• Erdős–Hajnal for graphs with no 5‐hole
• Graphs of large chromatic number
• scientific article; zbMATH DE number 3628985 (Why is no real title available?)
• scientific article; zbMATH DE number 970798 (Why is no real title available?)
• Induced Ramsey-type theorems
• Induced subgraph density. I: A loglog step towards Erdős-Hajnal
• Induced subgraph density. VI: Bounded VC-dimension
• On universality of graphs with uniformly distributed edges
• Pure pairs. I: Trees and linear anticomplete pairs
• Pure pairs. II: Excluding all subdivisions of a graph
• Ramsey-type theorems
• Ramsey-type theorems with forbidden subgraphs
• Recent developments in graph Ramsey theory
• String graphs have the Erdős-Hajnal property
• The Erdős-Hajnal conjecture for bull-free graphs
• The Erdős-Hajnal conjecture for paths and antipaths
• The Erdős-Hajnal conjecture. A survey
• Towards the Erdős-Hajnal conjecture for P₅-free graphs

This page was built for publication: Induced subgraph density. VII: The five-vertex path

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