A note on a Broken-cycle Theorem for hypergraphs
Combinatorics
2012-09-25 v1
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.
Cite
@article{arxiv.1209.5069,
title = {A note on a Broken-cycle Theorem for hypergraphs},
author = {Martin Trinks},
journal= {arXiv preprint arXiv:1209.5069},
year = {2012}
}
Comments
5 pages