INDISPENSABLE BINOMIALS OF FINITE GRAPHS
From MaRDI portal
Publication:5703218
DOI10.1142/S0219498805001265zbMath1093.13020MaRDI QIDQ5703218
Takayuki Hibi, Hidefumi Ohsugi
Publication date: 8 November 2005
Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)
05C90: Applications of graph theory
05C38: Paths and cycles
13F20: Polynomial rings and ideals; rings of integer-valued polynomials
13F55: Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes
Related Items
Arithmetical rank of toric ideals associated to graphs, Minimal systems of binomial generators and the indispensable complex of a toric ideal, Asymptotic properties in the shifted family of a numerical semigroup with few generators, Toric ideals and their circuits, On complete intersection toric ideals of graphs, Many toric ideals generated by quadratic binomials possess no quadratic Gröbner bases, Minimal generators of toric ideals of graphs, Distance-reducing Markov bases for sampling from a discrete sample space, Generalized robust toric ideals, Markov bases and generalized Lawrence liftings, Binomial fibers and indispensable binomials, Markov basis and Gröbner basis of Segre-Veronese configuration for testing independence in group-wise selections, A generalization of the integer linear infeasibility problem, Indispensable monomials of toric ideals and Markov bases, On the generalized Scarf complex of lattice ideals, Markov bases for two-way subtable sum problems, Graver basis for an undirected graph and its application to testing the beta model of random graphs, Toric ideals associated with gap-free graphs, Minimal generating sets of lattice ideals, Ideals and graphs, Gröbner bases and decision procedures in graphs, The largest group of invariance for Markov bases and toric ideals, COMBINATORIAL DEGREE BOUND FOR TORIC IDEALS OF HYPERGRAPHS, On the binomial arithmetical rank of toric ideals, Indispensable binomials in semigroup ideals, Matroid Toric Ideals: Complete Intersection, Minors, and Minimal Systems of Generators, Indispensable Hibi Relations and Gröbner Bases
Cites Work
- Normal polytopes arising from finite graphs
- A normal \((0,1)\)-polytope none of whose regular triangulations is unimodular
- Toric ideals generalized by quadratic binomials
- Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
- Some Properties of Graphs with Multiple Edges
