Proof Pearl: A Probabilistic Proof for the Girth-Chromatic Number Theorem
From MaRDI portal
Publication:2914757
DOI10.1007/978-3-642-32347-8_27zbMath1360.68763OpenAlexW2222742436MaRDI QIDQ2914757
Publication date: 20 September 2012
Published in: Interactive Theorem Proving (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32347-8_27
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (4)
Isabelle formalisation of original representation theorems ⋮ Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL ⋮ Formalization of the Domination Chain with Weighted Parameters (Short Paper) ⋮ Girth-Chromatic
Uses Software
This page was built for publication: Proof Pearl: A Probabilistic Proof for the Girth-Chromatic Number Theorem