ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PP be a path with vertex set VV, and let (A1,…,Am)(A_1,\ldots,A_m) be a partition of VV. Simultaneous deficit conjecture. There exists a subset S⊆VS\subseteq V independent in PP such that

∣S∩Ai∣≥∣Ai∣2−1|S\cap A_i|\ge \frac{|A_i|}{2}-1

for every i≤mi\le m, with strict inequality holding for all but at most m/2m/2 of the sets AiA_i. The claim strengthens the separately known total-deficit and almost-fair representation bounds for paths. The supplied text gives no resolution status.

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.