ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph and let IGI_G be its cut ideal. A graph is K5K_5-minor-free when it has no minor isomorphic to K5K_5. Quartic generation conjecture.

IG is generated in degrees ≤4⟺G is K5-minor-free.I_G \text{ is generated in degrees }\leq 4\quad\Longleftrightarrow\quad G \text{ is }K_5\text{-minor-free}.

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 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.