Cut ideals of K₄-minor free graphs are generated by quadrics

From MaRDI portal
Publication:654935



Abstract: Cut ideals are used in algebraic statistics to study statistical models defined by graphs. Intuitively, topological restrictions on the graphs should imply structural statements about the corresponding cut ideals. Several theorems and many computer calculations support that. Sturmfels and Sullivant conjectured that the cut ideal is generated by quadrics if and only if the graph is free of K4-minors. Parts of the conjecture has been resolved by Brennan and Chen, and later by Nagel and Petrovic. We prove the full conjecture by introducing a new type of toric fiber product theorem.


The cut ideal \(I_{G}\) of a finite graph \(G\) describe questions in applied science (statistics, optimization, computer science, etc) into questions in commutative algebra. In [\textit{B. Sturmfels} and \textit{S. Sullivant}, Mich. Math. J. 57, 689--709 (2008; Zbl 1180.13040)] the algebraic properties of cut ideals for graphs with up to six vertices were studied and a number of conjectures were outlined. The paper under review considers one of these conjectures, namely: The cut ideal \(I_{G}\) is generated by quadrics if and only if \(G\) is free of \(K_{4}\)-minors. The conjecture follows as a corollary of Theorem 2.6, which gives a description of generating set of \(I_G\), and was proven by induction on the number of vertices of \(G\).











This page was built for publication: Cut ideals of \(K_{4}\)-minor free graphs are generated by quadrics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654935)