next up previous
Next: Rich submatrices Up: More exercises Previous: Ramsey theorem for bipartite

List chromatic number of bipartite graphs


\begin{proof} Let $G=(V_1,V_2,E)$\ be a bipartite graph with $\vert V_1\vert=... ...at least one color $c\in C_v$\ such that $i_c=i$. }\end{itemize} \end{proof}

Jukna 2003-01-15