Minors in ‐ Chromatic Graphs, II
Alexandr V. Kostochka · Journal of Graph Theory · 2013
Abstract Let denote the graph obtained from the complete graph by deleting the edges of some ‐subgraph. The author proved earlier that for each fixed s and , every graph with chromatic number has a minor. This confirmed a partial case of the corresponding conjecture by Woodall and Seymour. In this paper, we show that the statement holds already for much smaller t, namely, for .