A note on a Broken-cycle Theorem for hypergraphs
classification
🧮 math.CO
keywords
theorembroken-cyclehypergraphschromaticcyclesdefinitionedgegive
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.