Divisors on graphs, Connected flags, and Syzygies - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2013

Divisors on graphs, Connected flags, and Syzygies


We study the binomial and monomial ideals arising from linear equivalence of divisors on graphs from the point of view of Gröbner theory. We give an explicit description of a minimal Gröbner basis for each higher syzygy module. In each case the given minimal Gröbner basis is also a minimal generating set. The Betti numbers of $I_G$ and its initial ideal (with respect to a natural term order) coincide and they correspond to the number of ``connected flags'' in $G$. Moreover, the Betti numbers are independent of the characteristic of the base field.
Fichier principal
Vignette du fichier
dmAS0175.pdf (391.06 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01229678 , version 1 (17-11-2015)



Fatemeh Mohammadi, Farbod Shokrieh. Divisors on graphs, Connected flags, and Syzygies. 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), 2013, Paris, France. pp.885-896, ⟨10.46298/dmtcs.2351⟩. ⟨hal-01229678⟩


43 View
694 Download



Gmail Facebook Twitter LinkedIn More