Hajós' theorem for list colorings of hypergraphs
C. Benzaken, Sylvain Gravier, Riste Škrekovski · Discussiones Mathematicae Graph Theory · 2003
A well-known theorem of Hajós claims that every graph with chromathic number greater than k can be constructed from disjoint copies of the complete graph K k+1 by repeated application of three simple operations.This classical result has been extended in 1978 to colorings of hypergraphs by C. Benzaken and in 1996 to list-colorings of graphs by S. Gravier.In this note, we capture both variations to extend Hajós' theorem to list-colorings of hypergraphs.