K4-minor conjecture for negative coefficients of graph independence Rayleigh differences
Let be a graph and let be edges of . Write for the Rayleigh difference of the independence-set partition function. K4-minor conjecture. If this polynomial has a negative coefficient, then has a -minor in which the images of and occur on nonadjacent edges. The conjecture implies the adjacent-edge coefficient conjecture and remains open in the source.
References
Primary source
David G. Wagner, “Negatively correlated random variables and Mason's conjecture”, arXiv:math/0602648 (2006).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.