ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let DD be a target, let ∣D∣|D| denote its total demand, and let s(D)s(D) denote the parameter used in the source.

Strong Target Conjecture. Every graph GG satisfies

π(G,D)≤π∣D∣(G)−s(D)+1\pi(G,D)\leq \pi_{|D|}(G)-s(D)+1

for every target DD.

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 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.