A combinatorial proof of the Rayleigh formula for graphs

DOI10.1016/j.disc.2007.11.011zbMath1173.05347OpenAlexW2022298581MaRDI QIDQ998327

Young-Bin Choe

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.011

zbMATH Keywords

graphic matroidgenerating polynomialRayleigh monotonicityRayleigh formulaRayleigh matroid

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial aspects of matroids and geometric lattices (05B35) Graph minors (05C83)

Related Items

Matroids—the Engineers’ Revenge

Cites Work

• Matrix tree theorems
• Homogeneous multivariate polynomials with the half-plane property
• Polynomials with the half-plane property and the support theorems
• The dissection of rectangles into squares
• Rayleigh Matroids
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• Negative association in uniform forests and connected graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item