It is known that the Mycielski graph can be generalized to obtain an infinite family of 4-chromatic graphs with no short odd cycles. The first proof of this result, due to Stiebitz, applied the topological method of Lovász. The proof presented here is elementary combinatorial.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics