Date of Award


Degree Type


Degree Name

Doctor of Philosophy in Mathematics



First Advisor

Lubos Thoma


A uniform hypergraph is properly k-colorable if each vertex is colored by one of k colors and no edge is completely colored by one color. In 2008 Hillar and Windfeldt gave a complete characterization of the k-colorability of graphs through algebraic methods. We generalize their work and give a complete algebraic characterization of the k-colorability of r-uniform hypergraphs. In addition to general k colorability, we provide an alternate characterization for 2-colorability and apply this to some constructions of hypergraphs that are minimally non-2- colorable.

We also provide examples and verification of minimality for non-2-colorable 5- and 6-uniform hypergraphs. As a further application, we give a characterization for a uniform hypergraph to be conflict-free colorable.

Finally, we provide an improvement on the construction introduced by Abbott and Hanson in 1969, and improved upon by Seymour in 1974.



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.