A Probabilistic Proof of the Girth-Chromatic Number Theorem

Lars Noschinski 🌐

February 6, 2012

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


This works presents a formalization of the Girth-Chromatic number theorem in graph theory, stating that graphs with arbitrarily large girth and chromatic number exist. The proof uses the theory of Random Graphs to prove the existence with probabilistic arguments.


BSD License


Session Girth_Chromatic