An inductive proof of Whitney's Broken Circuit Theorem
We present a new proof of Whitney's broken circuit theorem based on induction on the number of edges and the deletion-contraction formula.
A note on Möbius inversion over power set lattices
In this paper, we establish a theorem on Möbius inversion over power set lattices which strongly generalizes an early result of Whitney on graph colouring.
Inclusion-exclusion and network reliability.
Improved inclusion-exclusion identities and inequalities based on a particular class of abstract tubes.
On sums over partially ordered sets.
Improved inclusion-exclusion identities via closure operators.
Inequalities of Bonferroni-Galambos type with applications to the Tutte polynomial and the chromatic polynomial.
Bonferroni-Galambos inequalities for partition lattices.
A new two-variable generalization of the chromatic polynomial.
Page 1