Induced subgraphs of graphs with large chromatic number. XI. Orientations

DOI10.1016/j.ejc.2018.09.003zbMath1402.05062arXiv1711.07679MaRDI QIDQ1633601

Maria Chudnovsky, P. D. Seymour, Alexander D. Scott

Publication date: 20 December 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphs; chromatic number; trees; clique number; coloring

Mathematics Subject Classification ID

05C38: Paths and cycles

05C15: Coloring of graphs and hypergraphs

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