INDISPENSABLE BINOMIALS OF FINITE GRAPHS

DOI10.1142/S0219498805001265MaRDI QIDQ5703218zbMATH OpenOpenAlexFDO

Authors Hidefumi Ohsugi, Takayuki Hibi

Publication date 8 November 2005

Published in Journal of Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0219498805001265

zbMATH Keywords

chordal graphfinite graphodd cycle conditiontoric ideal

Mathematics Subject Classification ID

Paths and cycles (05C38) Applications of graph theory (05C90) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55)

Recommendations

• Minimal generators of toric ideals of graphs
• Minimal systems of binomial generators and the indispensable complex of a toric ideal
• Toric ideals of finite graphs and adjacent 2-minors
• Binomial fibers and indispensable binomials
• Arithmetical rank of toric ideals associated to graphs

Cites work

• A normal (0,1)-polytope none of whose regular triangulations is unimodular
• Normal polytopes arising from finite graphs
• Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
• Some Properties of Graphs with Multiple Edges
• Toric ideals generalized by quadratic binomials

Cited in

(28)

• 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
• Asymptotic properties in the shifted family of a numerical semigroup with few generators
• Matroid toric ideals: complete intersection, minors, and minimal systems of generators
• Indispensable Hibi relations and Gröbner bases
• 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
• Arithmetical rank of toric ideals associated to graphs
• Minimal systems of binomial generators and the indispensable complex of a toric ideal
• Minimal generators of toric ideals of graphs
• Toric splittings
• Splittings 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

This page was built for publication: INDISPENSABLE BINOMIALS OF FINITE GRAPHS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703218)