A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number

DOI10.1016/j.jctb.2022.09.001zbMath1502.05084arXiv2201.08204MaRDI QIDQ2101164

Benjamin Moore, Sophie Spirkl, Patrick Hompe, Alvaro Carbonero

Publication date: 28 November 2022

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

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

zbMATH Keywords

directed graph; induced subgraph; \(\chi\)-boundedness

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

05C20: Directed graphs (digraphs), tournaments

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