On robust toric ideals of weighted oriented graphs
Abstract
In this work, we study the equivalence of various robustness properties of toric ideals of weighted oriented graphs. For any weighted oriented graph D, if its toric ideal ID is generalized robust (or weakly robust), then we show that D does not have forbidden subgraphs D1,D2 of certain structures. We give a significant class of weighted oriented graphs D whose toric ideals ID have the following equivalence. (i) ID is strongly robust (equivalently, ID is robust); (ii) ID is generalized robust (equivalently, ID is weakly robust); (iii) D does not have subgraphs equal to D1 and D2.
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.