Answers to some problems about graph coloring test graphs
Combinatorics
2017-08-01 v2 Algebraic Topology
Abstract
We prove that a graph whose chromatic number is 2 is a homotopy test graph. We also prove that there is a graph with two involutions and such that is a Stiefel-Whitney test graph, but is not. These are answers to some of the problems suggested by Kozlov.
Cite
@article{arxiv.1303.1277,
title = {Answers to some problems about graph coloring test graphs},
author = {Takahiro Matsushita},
journal= {arXiv preprint arXiv:1303.1277},
year = {2017}
}
Comments
7 pages, 3 figures, final version. In the previous version, I actually solved a problem weaker than the original one