Another Simple Proof of the High Girth, High Chromatic Number Theorem

DOI10.1080/00029890.2008.11920498zbMath1145.05308OpenAlexW2404916836WikidataQ58259133 ScholiaQ58259133MaRDI QIDQ3505172

Simon Marshall

Publication date: 18 June 2008

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00029890.2008.11920498

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Cycles with consecutive odd lengths

This page was built for publication: Another Simple Proof of the High Girth, High Chromatic Number Theorem