H. A. Kierstead

most citedOn the choice number of complete multipartite graphs with part size four

3 citations · 5 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2014★ 3 cited

On the choice number of complete multipartite graphs with part size four

H. A. Kierstead, Andrew Salmon, Ran Wang

Let $ch (G)$ denote the choice number of a graph $G$ , and let $K_{s * k}$ be the complete $k$ -partite graph with $s$ vertices in each part. Erdős, Rubin, and Taylor showed th…

math.CO2010★ 2 cited

Toward a Hajnal-Szemeredi theorem for hypergraphs

Hal Kierstead, Dhruv Mubayi

Let $H$ be a triple system with maximum degree $d > 1$ and let $r > 1 0^{7} d lo g^{2} d$ . Then $H$ has a proper vertex coloring with $r$ colors such that any two color classes differ…