Splittings of toric ideals of graphs
Given a simple graph \(G\), the incidence matrix of \(G\) is used to define a toric ideal associated to \(G\), \(I_G\). The toric ideal \(I_G\) is said to be \textit{splittable} if there exist two proper subgraphs \(G_1\) and \(G_2\) of \(G\) such that \(I_G=I_{G_1}+I_{G_2}\).\N\NThe authors introduce the notion \textit{ edge splitting} (Definition 2.4) and show that \(I_G\) is splittable if and only if it is edge splittable (Theorem 2.10). This result is applied to toric ideal of complete bipartite graphs, which are shown to be not splittable (Corollary 2.12). Furthermore, the authors prove that the toric ideal of a complete graph \(K_n\) is splittable for \(n \ge 4\) (Theorem 3.2).\N\NThe rest of the paper is devoted to the study of \textit{minimal splittings} (Definition 3.3) and \textit{reduced splittings} (Definition 4.1).
- Centrally symmetric configurations of integer matrices
- Gluing and splitting of homogeneous toric ideals
- INDISPENSABLE BINOMIALS OF FINITE GRAPHS
- Lectures on algebraic statistics
- Minimal generators of toric ideals of graphs
- Minimal systems of binomial generators and the indispensable complex of a toric ideal
- Monomial algebras
- Normality of subrings generated by square free monomials
- Splittings of toric ideals
- Toric ideals generalized by quadratic binomials
This page was built for publication: Splittings of toric ideals of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7008706)
