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

DOI10.1080/00029890.2008.11920498MaRDI QIDQ3505172zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Cited in

(2)

• Graphs with large girth and chromatic number are hard for Nullstellensatz
• Cycles with consecutive odd lengths

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3505172)