ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a network, and let v≠wv\neq w be vertices of GG. The paper defines the property that the pair {v,w}\{v,w\} is amicable in GG through its associated polynomial interlacing conditions.

Amicability conjecture. For every network GG and every pair of distinct vertices vv and ww, the pair {v,w}\{v,w\} is amicable in GG.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.