GirthChromatic
swMATH ID:  29248 
Software Authors:  Lars Noschinski 
Description:  A Probabilistic Proof of the GirthChromatic Number Theorem. This works presents a formalization of the GirthChromatic 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. 
Homepage:  https://www.isaafp.org/entries/Girth_Chromatic.html 
Dependencies:  Isabelle 
Related Software:  Isabelle/HOL; Locales; Flyspeck; PVS; MetiTarski 
Referenced in:  1 Publication 
Standard Articles
1 Publication describing the Software, including 1 Publication in zbMATH  Year 

Proof pearl: a probabilistic proof for the girthchromatic number theorem. Zbl 1360.68763 Noschinski, Lars 
2012

Referenced by 1 Author
1  Noschinski, Lars 
Referenced in 0 Serials
Referenced in 2 Fields
1  Combinatorics (05XX) 
1  Computer science (68XX) 