Home » Author index

Moore, Benjamin


Graph Theory » Coloring » Vertex coloring

Cycles in Graphs of Large Chromatic Number ★★

Author(s): Brewster; McGuinness; Moore; Noel

Conjecture   If $ \chi(G)>k $, then $ G $ contains at least $ \frac{(k+1)(k-1)!}{2} $ cycles of length $ 0\bmod k $.

Keywords: chromatic number; cycles

Posted by Jon Noel
updated September 20th, 2015
add new comment
Syndicate content