Choosability of multipartite hypergraphs

Peter Bradshaw, Abhishek Dhawan, Nhi Dinh +2

A $k$-uniform hypergraph (or $k$-graph) $H=(V,E)$ is $k$-partite if $V$ can be partitioned into $k$ sets $V_1,\dots ,V_k$ such that each edge in $E$ contains precisely one ver…