Induced subgraphs of graphs with large chromatic number. XI. orientations
Fix an oriented graph , and let 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 ? Kierstead and Rödl (1996) raised this question for two specific kinds of digraph : the three-edge path, with the...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Published: |
Elsevier
2018
|