论文信息 - Rank-Three Matroids are Rayleigh

Rank-Three Matroids are Rayleigh

A Rayleigh matroid is one which satisfies a set of inequalities analogous to the Rayleigh monotonicity property of linear resistive electrical networks. We show that every matroid of rank three satisfies these inequalities.

David G. Wagner

[1] Olga Taussky-Todd. SOME CONCRETE ASPECTS OF HILBERT'S 17TH PROBLEM , 1996 .

[2] Atsushi Kaneko,et al. A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two , 2003, J. Comb. Theory, Ser. B.

[3] Martin Loebl,et al. On matroids induced by packing subgraphs , 1988, J. Comb. Theory, Ser. B.

[4] Gérard Cornuéjols,et al. An extension of matching theory , 1986, J. Comb. Theory, Ser. B.

[5] Gérard Cornuéjols,et al. Packing subgraphs in a graph , 1982, Oper. Res. Lett..

[6] James G. Oxley,et al. Matroid theory , 1992 .

[7] R. Lyons. Determinantal probability measures , 2002, math/0204325.

[8] Zoltán Király,et al. Packing paths of length at least two , 2004, Discret. Math..

[9] G. Kirchhoff. Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird , 1847 .

[10] Tomás Feder,et al. Balanced matroids , 1992, STOC '92.