Answers to some problems about graph coloring test graphs
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 γ1 and γ2 such that (K,γ1) is a Stiefel-Whitney test graph, but (K,γ2) is not. These are answers to some of the problems suggested by Kozlov.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.