Induced subgraphs of graphs with large chromatic number. VII: Gyárfás' complementation conjecture

DOI10.1016/j.jctb.2019.08.008zbMath1436.05076arXiv1701.06301MaRDI QIDQ1985444

P. D. Seymour, Alexander D. Scott

Publication date: 7 April 2020

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

induced subgraphs; chromatic number; cliques; \(\chi\)-bounded

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

05C17: Perfect graphs

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)