A combinatorial proof of the Rayleigh formula for graphs

DOI10.1016/J.DISC.2007.11.011zbMATH Open1173.05347OpenAlexW2022298581MaRDI QIDQ998327FDOQ998327

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

Recommendations

• Rank-three matroids are Rayleigh
• Rayleigh Matroids
• Sums of squares and negative correlation for spanning forests of series parallel graphs
• Complete monotonicity for inverse powers of some combinatorially defined polynomials
• A new proof of Foster's first theorem

zbMATH Keywords

generating polynomialgraphic matroidRayleigh 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Homogeneous multivariate polynomials with the half-plane property
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• The dissection of rectangles into squares
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Matrix tree theorems
• Polynomials with the half-plane property and the support theorems
• Rayleigh Matroids
• Negative association in uniform forests and connected graphs

Cited In (2)

• On the combinatorial structure of Rauzy graphs
• Matroids—the Engineers’ Revenge

This page was built for publication: A combinatorial proof of the Rayleigh formula for graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998327)