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 { v 1 , … , v n } . An algebraic object attached to G is the toric ideal I G . We say that I G is subgraph splittable if there exist subgraphs G 1 and G 2 of G such that I G = I G 1 + I G 2 , where both I G 1 and I G 2 are not equal to I G . We show that 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 K n is always subgraph splittable when n ≥ 4 . Additionally, we show that the toric ideal of K n has a minimal splitting if and only if 4 ≤ n ≤ 5 . Finally, we prove that any minimal splitting of 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.