Elementary proof of Rayleigh formula for graphs

Simple item page
dc.creatorCibulka, Josef
dc.creatorHladký, Jan
dc.date2008-03-31
dc.date.accessioned2026-07-07T09:29:24Z
dc.date.available2026-07-07T09:29:24Z
dc.descriptionThe 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.
dc.description7 pages
dc.identifierhttps://arxiv.org/abs/0803.4395
dc.identifierhttp://arxiv.org/abs/0803.4395
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/157773
dc.subjectCombinatorics
dc.subject05C05; 05A20
dc.titleElementary proof of Rayleigh formula for graphs
dc.typetext

Files

Collections

arXiv