A Probabilistic Proof of the Girth-Chromatic Number Theorem

MaRDI QIDQ7361891FDO

Authors Lars Noschinski

Publication date 6 February 2012

Cites work

• Graph theory

Cited in

(6)

• Szemerédi's Regularity Lemma
• Undirected Graph Theory
• Roth's Theorem on Arithmetic Progressions
• Hypergraph Colouring Bounds
• Turán's Graph Theorem
• Properties of Random Graphs -- Subgraph Containment

This page was built for software: A Probabilistic Proof of the Girth-Chromatic Number Theorem