Indexed metadata

Splittings of toric ideals of graphs

Anargyros Katsabekis, Apostolos Thoma

Source record

Source: Crossref

Published: Feb 1, 2025

DOI: 10.1007/s10801-025-01381-y

Open original source ↗

Source abstract

Abstract Let G be a simple graph on the vertex set {v1,…,vn}\{v_{1},\ldots ,v_{n}\} { v 1 , … , v n } . An algebraic object attached to G is the toric ideal IGI_G I G . We say that IGI_G I G is subgraph splittable if there exist subgraphs G1G_1 G 1 and G2G_2 G 2 of G such that IG=IG1+IG2I_G=I_{G_1}+I_{G_2} I G = I G 1 + I G 2 , where both IG1I_{G_1} I G 1 and IG2I_{G_2} I G 2 are not equal to IGI_G I G . We show that IGI_G I G 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 KnK_n K n is always subgraph splittable when n≥4n \ge 4 n ≥ 4 . Additionally, we show that the toric ideal of KnK_n K n has a minimal splitting if and only if 4≤n≤54 \le n \le 5 4 ≤ n ≤ 5 . Finally, we prove that any minimal splitting of IGI_G I G is also a reduced splitting.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.