Simultaneous deficit conjecture for independent sets of paths
Statement
Let be a path with vertex set , and let be a partition of . Simultaneous deficit conjecture. There exists a subset independent in such that
for every , with strict inequality holding for all but at most of the sets . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.