A note on a Broken-cycle Theorem for hypergraphs

2012/09/23 by Martin Trinks, Trinks, Martin
Computer Science · Engineering · Mathematics · #05C15 #05C31 #Advanced Graph Theory Research #Advanced Topology and Set Theory #Combinatorics (math.CO) #FOS: Mathematics #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1209.5069

openalex publication_date 2012/09/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Generalized Whitney formulas for broken circuits in ambigraphs and matroids
• An Abstraction of Whitney's Broken Circuit Theorem
• A remark on the Whitney Broken Circuit Theorem
• Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
• Cycles in graphs and in hypergraphs: results and problems