A circulation in a digraph is a spanning subgraph with indegree equal to outdegree at each vertex. Alon and Tarsi proved that a graph is d-choosable when it has an orientation that has no vertex of outdegree at least d and has the property that the numbers of circulations with even-sized and odd-sized edge sets differ. We generalize this to k-uniform hypergraphs for prime k. We use a “hypergraph polynomial“ and a notion of hypergraph orientation defined by choosing a source vertex from each edge.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
* Project sponsored by the National Security Agency under Grant Number MDA904-03-1-0037. The United States Government is authorized to reproduce and distribute reprints notwithstanding any copyright notation herein.
Rights and permissions
About this article
Cite this article
Ramamurthi, R., West*, D.B. Hypergraph Extension Of The Alon-Tarsi List Coloring Theorem. Combinatorica 25, 355–366 (2005). https://doi.org/10.1007/s00493-005-0020-8
Received:
Issue Date:
DOI: https://doi.org/10.1007/s00493-005-0020-8