Strong Target Conjecture
Statement
Let be a graph, let be a target, let denote its total demand, and let denote the parameter used in the source.
Strong Target Conjecture. Every graph satisfies
for every target .
The source reports that this stronger inequality is known for trees and powers of paths, but remains unproved for general graphs.
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.