Wagner's sum-of-squares conjecture for spanning-forest Rayleigh differences
Wagner's sum-of-squares conjecture for spanning-forest Rayleigh differences
Let be a graph, and let and be distinct edges. Write for the generating polynomial of its spanning forests, and let be the collection of sets such that is contained in a cycle of . For each , let be the collection of spanning forests such that and for a unique cycle . Here and . Wagner's sum-of-squares conjecture. For some choice of signs ,
This identity would give a sum-of-squares certificate for the nonnegativity of the spanning-forest Rayleigh difference and hence imply that graphs are -Rayleigh. The statement is presented as a conjecture in the source; no resolution is supplied here.
Sources & referencesView supporting material
Primary source
Alejandro Erickson, “Sums of squares and negative correlation for spanning forests of series parallel graphs”, arXiv:1008.3660 (2011).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.