Splittings of toric ideals of graphs

Abstract

Let G be a simple graph on the vertex set \v1,…,vn\. An algebraic object attached to G is the toric ideal IG. We say that IG is subgraph splittable if there exist subgraphs G1 and G2 of G such that IG=IG1+IG2, where both IG1 and IG2 are not equal to IG. We show that IG is subgraph splittable if and only if it is edge splittable. We also prove that the toric ideal of a complete bipartite graph is not subgraph splittable. In contrast, we show that the toric ideal of a complete graph Kn is always subgraph splittable when n ≥ 4. Additionally, we show that the toric ideal of Kn has a minimal splitting if and only if 4 ≤ n ≤ 5. Finally, we prove that any minimal splitting of IG is also a reduced splitting.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…