Related papers: Ring graphs and complete intersection toric ideals
Let A_1,...,A_k be a collection of families of subsets of an n-element set. We say that this collection is cross-intersecting if for any i,j in [k] with i not equal to j, A in A_i and B in A_j implies that the intersection of A and B is…
We consider the phylogenetic tree model in which every node of the tree is observed and binary and the transitions are given by the same matrix on each edge of the tree. We are able to compute the Grobner basis and Markov basis of the toric…
Recently, Milani\v{c} and Trotignon introduced the class of equistarable graphs as graphs without isolated vertices admitting positive weights on the edges such that a subset of edges is of total weight $1$ if and only if it forms a maximal…
The universal Gr\"obner basis of an ideal is a Gr\"obner basis with respect to all term orders simultaneously. The aim of this paper is to present an algorithmic approach to compute the universal Gr\"obner basis for the toric ideal…
We present the theory of multifunctions applied to graphs. Its interesting feature is that walks are recognized as iterations. We consider the graphs with arbitrary number of vertices which are determined by multifunctions. The mutually…
Let $n$ be an even natural number. We compute the periods of any $\frac{n}{2}$-dimensional complete intersection algebraic cycle inside an $n$-dimensional non-degenerated intersection of a projective simplicial toric variety. Using this…
A classical enumerative result states that, given a graph $G$ and a vertex $u$, the number of connected subgraphs of $G$ is equal to the number of orientations of $G$ such that every vertex can reach $u$ by a directed path. We show that…
If $G$ is a finite group, then the spectrum $\omega(G)$ is the set of all element orders of $G$. The prime spectrum $\pi(G)$ is the set of all primes belonging to $\omega(G)$. A simple graph $\Gamma(G)$ whose vertex set is $\pi(G)$ and in…
The symmetries of complex molecular structures can be modeled by the {\em topological symmetry group} of the underlying embedded graph. It is therefore important to understand which topological symmetry groups can be realized by particular…
For the family of graded lattice ideals of dimension 1, we establish a complete intersection criterion in algebraic and geometric terms. In positive characteristic, it is shown that all ideals of this family are binomial set theoretic…
The first goal of the present paper is to study the class groups of the edge rings of complete multipartite graphs, denoted by $\Bbbk[K_{r_1,\ldots,r_n}]$, where $1 \leq r_1 \leq \cdots \leq r_n$. More concretely, we prove that the class…
Let X be an algebraic toric set in a projective space over a finite field. We study the vanishing ideal, I(X), of X and show some useful degree bounds for a minimal set of generators of I(X). We give an explicit description of a set of…
In the present paper, we study conic divisorial ideals of toric rings. We provide an idea to determine them and we give a description of the conic divisorial ideals of Hibi rings and stable set rings of perfect graphs by using this idea. We…
We define pure graphs, invertible graphs, and the notion of complementation of bicoloured graphs. The study of pure graphs is motivated by two conjectures about the transition systems of eulerian graphs and by the Cycle Double Cover…
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…
The perfectly matchable subgraph polytope of a graph is a (0,1)-polytope associated with the vertex sets of matchings in the graph. In this paper, we study algebraic properties (compressedness, Gorensteinness) of the toric rings of…
Let $R$ be a commutative ring with identity and ${\rm Nil}(R)$ be the set of nilpotent elements of $R$. The nil-graph of ideals of $R$ is defined as the graph $\mathbb{AG}_N(R)$ whose vertex set is $\{I:\ (0)\neq I\lhd R$ and there exists a…
We investigate, using the notion of linear quotients, significative classes of connected graphs whose monomial edge ideals, not necessarily squarefree, have linear resolution, in order to compute standard algebraic invariants of the…
In this paper we present a simple unifying approach to prove several statements about intersecting and cross-intersecting families, including the Erd\H os--Ko--Rado theorem, the Hilton--Milner theorem, a theorem due to Frankl concerning the…
We characterize all graphs whose binomial edge ideals have pure resolutions. Moreover, we introduce a new switching of graphs which does not change some algebraic invariants of graphs, and using this, we study the linear strand of the…