Induced subgraphs of graphs with large chromatic number. X. Holes of specific residue

DOI10.1007/s00493-019-3804-yzbMath1449.05110arXiv1705.04609OpenAlexW2962699603MaRDI QIDQ2288360

P. D. Seymour, Alexander D. Scott

Publication date: 17 January 2020

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.04609

zbMATH Keywords

chromatic numberclique numbercomplete subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (11)

Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case ⋮ The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor ⋮ Polynomial bounds for chromatic number VII. Disjoint holes ⋮ Proof of the Kalai-Meshulam conjecture ⋮ Graphs of large chromatic number ⋮ Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey ⋮ Detecting a long odd hole ⋮ Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings ⋮ Pure pairs. II: Excluding all subdivisions of a graph ⋮ Homomorphism Reconfiguration via Homotopy ⋮ From \(\chi\)- to \(\chi_p\)-bounded classes

This page was built for publication: Induced subgraphs of graphs with large chromatic number. X. Holes of specific residue