×

Girth-Chromatic

swMATH ID: 29248
Software Authors: Lars Noschinski
Description: A Probabilistic Proof of the Girth-Chromatic Number Theorem. 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.
Homepage: https://www.isa-afp.org/entries/Girth_Chromatic.html
Dependencies: Isabelle
Related Software: Isabelle/HOL; Locales; Flyspeck; PVS; MetiTarski
Referenced in: 1 Publication

Referenced by 1 Author

1 Noschinski, Lars

Referenced in 0 Serials

Referencing Publications by Year