TY  - JOUR
ID  - DrgasBurchardt2004
LB  - DrgasBurchardt2004
AU  - Drgas-Burchardt, Ewa
TI  - A note on a list colouring of hypergraphs
ST  - A note on a list colouring of hypergraphs
JO  - Opuscula Math.
JA  - Opuscula Math.
JF  - Opuscula Mathematica
PY  - 2004
VL  - 24
IS  - 2
SP  - 171
EP  - 175
DO  - http://dx.doi.org/10.7494/OpMath.2004.24.2.171
UR  - http://dx.doi.org/10.7494/OpMath.2004.24.2.171
AB  - In the note we present two results. The first of them gives a sufficient condition for a colouring of a hypergraph from an assigned list. It generalises the analogous fact for graphs. The second result states that for every \(k\geq 3\) and every \(l\geq 2\), a distance between the list chromatic number and the chromatic number can be arbitrarily large in the class of \(k\)-uniform hypergraphs with the chromatic number bounded below by \(l\). A similar result for \(k\)-uniform, \(2\)-colorable hypergraphs is known but the proof techniques are different.
KW  - hypergraph
KW  - list colouring
SN  - 1232-9274
ER  -