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

lattice; Riemann zeta function; Möbius function; domination polynomial; graph polynomial; closure system; convex geometry; broken circuit; beta invariant; Dirichlet inverse; MAX-MIN identity; totient

Mathematics Subject Classification ID

05C31: Graph polynomials

05A15: Exact enumeration problems, generating functions

06A07: Combinatorics of partially ordered sets

05C30: Enumeration in graph theory

52A01: Axiomatic and generalized convexity

05C15: Coloring of graphs and hypergraphs

11A25: Arithmetic functions; related numbers; inversion formulas

Related Items

A broken cycle theorem for the restrained chromatic function, Inclusion-exclusion by ordering-free cancellation, 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)