Sums of squares and negative correlation for spanning forests of series parallel graphs

Details Sums of squares and negative correlation for spanning forests of series parallel graphs Sums of squares and negative correlation for spanning forests of series parallel graphs

2010-08-21

arxiv.org/abs/1008.3660v3

Mathematics

Combinatorics

12 pages, 1 figure. Accepted in The Australasian Journal of Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Sums of squares and negative correlation for spanning forests of series parallel graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sums of squares and negative correlation for spanning forests of series parallel graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sums of squares and negative correlation for spanning forests of series parallel graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-189092