Induced subgraphs of graphs with large chromatic number. XI. Orientations
From MaRDI portal
Publication:1633601
DOI10.1016/J.EJC.2018.09.003zbMATH Open1402.05062arXiv1711.07679OpenAlexW2963684155WikidataQ129125269 ScholiaQ129125269MaRDI QIDQ1633601
Author name not available (Why is that?)
Publication date: 20 December 2018
Published in: (Search for Journal in Brave)
Abstract: Fix an oriented graph H, and let G be a graph with bounded clique number and very large chromatic number. If we somehow orient its edges, must there be an induced subdigraph isomorphic to H? Kierstead and Rodl raised this question for two specific kinds of digraph H: the three-edge path, with the first and last edges both directed towards the interior; and stars (with many edges directed out and many directed in). Aboulker et al subsequently conjectured that the answer is affirmative in both cases. We give affirmative answers to both questions.
Full work available at URL: https://arxiv.org/abs/1711.07679
No records found.
No records found.
This page was built for publication: Induced subgraphs of graphs with large chromatic number. XI. Orientations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1633601)
