Rayleigh conjecture for graph component-size weights
Statement
Let be a finite connected graph. For each independent edge set of , let be the product of the sizes of the connected components of , and let vanish outside the independent sets. Graph component-weight Rayleigh conjecture. The weight function is Rayleigh. The source gives real-rootedness of an associated generating polynomial but leaves this stronger Rayleigh assertion open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.