Quartic generation conjecture for cut ideals
Statement
Let be a graph and let be its cut ideal. A graph is -minor-free when it has no minor isomorphic to . Quartic generation conjecture.
This extends the proposed characterization for quadratic generation. It is presented as a conjectural description of the complexity of Markov bases for graph cuts, and the authors also suggest that it captures the class of graphs with normal and Cohen–Macaulay cut ideals; that latter relationship is stated separately below.
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.