Coloring graphs with no induced subdivision of $K_4^+$
Combinatorics
2019-01-21 v2
Abstract
Let be the 5-vertex graph obtained from , the complete graph on four vertices, by subdividing one edge precisely once (i.e. by replacing one edge by a path on three vertices). We prove that if the chromatic number of some graph is much larger than its clique number, then contains a subdivision of as an induced subgraph.
Cite
@article{arxiv.1901.04170,
title = {Coloring graphs with no induced subdivision of $K_4^+$},
author = {Louis Esperet and Nicolas Trotignon},
journal= {arXiv preprint arXiv:1901.04170},
year = {2019}
}
Comments
4 pages - v2 corrected typos