Sums of squares and negative correlation for spanning forests of series parallel graphs
From MaRDI portal
Publication:3166100
zbMATH Open1248.05029arXiv1008.3660MaRDI QIDQ3166100FDOQ3166100
Publication date: 21 October 2012
Abstract: We provide new evidence that spanning forests of graphs satisfy the same negative correlation properties as spanning trees, derived from Lord Rayleigh's monotonicity property for electrical networks. The main result of this paper is that the Rayleigh difference for the spanning forest generating polynomial of a series parallel graph can be expressed as a certain positive sum of monomials times squares of polynomials. We also show that every regular matroid is independent-set-Rayleigh if and only if every basis-Rayleigh binary matroid is also independent-set-Rayleigh.
Full work available at URL: https://arxiv.org/abs/1008.3660
Trees (05C05) Combinatorial aspects of matroids and geometric lattices (05B35) Structure and representation theory of distributive lattices (06D05)
This page was built for publication: Sums of squares and negative correlation for spanning forests of series parallel graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166100)
