The bounded enumeration conjecture for induced cuts
Statement
For a graph with the parameters and family of cuts defined in Lemma~, let denote the corresponding family of induced cuts. Bounded enumeration conjecture. Lemma~ holds with
This conjecture proposes that the family of induced cuts can be bounded independently of the graph size, depending only exponentially on . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.