Amicability conjecture for vertex pairs in networks
Statement
Let be a network, and let be vertices of . The paper defines the property that the pair is amicable in through its associated polynomial interlacing conditions.
Amicability conjecture. For every network and every pair of distinct vertices and , the pair is amicable in .
This conjecture is stated as a strengthening that would imply the paper’s earlier conjecture. The source proves the property for series-parallel networks and notes related results for cactus networks, but does not resolve it for arbitrary networks.
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.