pith. sign in

arxiv: 1303.1277 · v2 · pith:ZBS54IU6new · submitted 2013-03-06 · 🧮 math.CO · math.AT

Answers to some problems about graph coloring test graphs

classification 🧮 math.CO math.AT
keywords graphgammatestanswersproblemsprovesomechromatic
0
0 comments X
read the original abstract

We prove that a graph whose chromatic number is 2 is a homotopy test graph. We also prove that there is a graph $K$ with two involutions $\gamma_1$ and $\gamma_2$ such that $(K,\gamma_1)$ is a Stiefel-Whitney test graph, but $(K,\gamma_2)$ is not. These are answers to some of the problems suggested by Kozlov.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.