On list chromatic numbers of 2-colorable hypergraphs

arXiv2102.02746MaRDI QIDQ6359873FDOQ6359873

Authors: Danila Cherkashin, Alexey Gordeev 

Publication date: 4 February 2021

Abstract: We give an upper bound on the list chromatic number of a 2-colorable hypergraph which generalizes the bound of Schauz on $k$-partite $k$-uniform hypergraphs. It makes sense for sparse hypergraphs: in particular we show that a $k$-uniform $k$-regular hypergraph has the list chromatic number 2 for $kgeq4$. Also we obtain both lower and upper bound on the list chromatic number of a complete $s$-uniform 2-colorable hypergraph in the vein of Erd{H o}s--Rubin--Taylor theorem.

This page was built for publication: On list chromatic numbers of 2-colorable hypergraphs

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