A note on a Broken-cycle Theorem for hypergraphs
arXiv:1209.5069
Abstract
Whitney's Broken-cycle Theorem states the chromatic polynomial of a graph as a sum over special edge subsets. We give a definition of cycles in hypergraphs that preserves the statement of the theorem there.
5 pages