2008/03/31 by Josef Cibulka, Jan Hladký, Cibulka, Josef +1
Computer Science · Mathematics · #05A20 #05C05 #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory #Topological and Geometric Data Analysis #math.CO #msc:05A20 #msc:05C05
paper · pdf · doi:10.48550/arxiv.0803.4395
7 pages
arxiv created 2008/03/31 · openalex publication_date 2008/03/31 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The Rayleigh monotonicity is a principle from the theory of electrical networks. Its combinatorial interpretation says for each two edges of a graph G, that the presence of one of them in a random spanning tree of G is negatively correlated with the presence of the other edge. In this paper we give a self-contained (inductive) proof of Rayleigh monotonicity for graphs.