ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph with the parameters and family of cuts defined in Lemma~, let Cind\mathcal{C}^{\mathrm{ind}} denote the corresponding family of induced cuts. Bounded enumeration conjecture. Lemma~ holds with

∣Cind∣≤2O(1/δ).|\mathcal{C}^{\mathrm{ind}}| \leq 2^{O(1/\delta)}.

This conjecture proposes that the family of induced cuts can be bounded independently of the graph size, depending only exponentially on 1/δ1/\delta. The supplied text gives no resolution or further evidence for the conjecture.

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.