An abstraction of Whitney's broken circuit theorem

zbMath1302.05086arXiv1404.5480MaRDI QIDQ470960

Klaus Dohmen, Martin Trinks

Publication date: 13 November 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.5480

zbMATH Keywords

latticeRiemann zeta functionMöbius functiondomination polynomialgraph polynomialclosure systemconvex geometrybroken circuitbeta invariantDirichlet inverseMAX-MIN identitytotient

Mathematics Subject Classification ID

Graph polynomials (05C31) Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07) Enumeration in graph theory (05C30) Axiomatic and generalized convexity (52A01) Coloring of graphs and hypergraphs (05C15) Arithmetic functions; related numbers; inversion formulas (11A25)

Related Items (6)

Inclusion-exclusion by ordering-free cancellation ⋮ The odd-valued chromatic polynomial of a signed graph ⋮ The list-coloring function of signed graphs ⋮ A broken cycle theorem for the restrained chromatic function ⋮ Recursion relations for chromatic coefficients for graphs and hypergraphs ⋮ Flow polynomials of a signed graph

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Note on the subgraph component polynomial
• On extremal hypergraphs for Hamiltonian cycles
• Domination reliability
• The enumeration of vertex induced subgraphs with respect to the number of components
• The theory of convex geometries
• An improvement of the inclusion-exclusion principle
• A broken-circuits-theorem for hypergraphs
• Möbius functions of lattices
• Abstract tubes, improved inclusion-exclusion identities and inequalities and importance sampling
• Principle of inclusion-exclusion on semilattices
• A note on a broken-cycle theorem for hypergraphs
• Supersolvable lattices
• Mean value for the matching and dominating polynomial
• A Graph Polynomial Approach to Primitivity
• A higher invariant for matroids
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
• A Graph Polynomial Arising from Community Structure (Extended Abstract)

This page was built for publication: An abstraction of Whitney's broken circuit theorem