Open Problem Garden

discrete homotopy

Same day loans,Instant Loans

INFINITY

ZERO

JUSTIN ABRAHAM

24 hour loans for unemployed, loans for unemployed

24 hour loans for unemployed, loans for unemployed

Graph Theory » Coloring » Vertex coloring

Choice Number of k-Chromatic Graphs of Bounded Order ★★

Author(s): Noel

Conjecture If $G$ is a $k$ -chromatic graph on at most $mk$ vertices, then $\text{ch}(G)\leq \text{ch}(K_{m*k})$ .

Keywords: choosability; complete multipartite graph; list coloring

Posted by Jon Noel
updated February 2nd, 2013

add new comment

Atserias, Albert

Retkes, Zoltan