Contents

Ars Combinatoria

  • Research article

A Combinatorial Proof of Rayleigh Monotonicity for Graphs

Josef Cibulka1, Jan Hladky2, Michael A.La Croix3, David G.Wagner3
1DEPARTMENT OF APPLIED MATHEMATICS, CHARLES UNIVERSITY, MALOSTRANSKE NAM. 25, 118 00 PRAHA 1, CZECH REPUBLIC
2DEPARTMENT OF APPLIED MATHEMATICS, CHARLES UNIVERSITY, MALOSTRANSKE NAM. 25, 118 00 PraHaA 1, CZECH REPUBLIC AND ZENTRUM MATHEMATIK (GRUPPE M9), TECHNISCHE UNIVERSITAT MUNCHEN, BOLTZMANNSTRASSE 3, D-85747 GARCHING BEI MUONCHEN, GERMANY
3DEPARTMENT OF COMBINATORICS AND OPTIMIZATION, UNIVERSITY OF WATERLOO, WATERLOO, ONTARIO, CANADA N2L 3G1
  • Published: 31/10/2014

Abstract

We give an elementary, self-contained, and purely combinatorial proof of the Rayleigh monotonicity property of graphs.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Josef Cibulka, Jan Hladky, Michael A.La Croix, David G.Wagner. A Combinatorial Proof of Rayleigh Monotonicity for Graphs[J], Ars Combinatoria, Volume 117. 333-348. .