Related papers: A Gr\"obner basis characterization for chordal com…
Two directed graphs are called covariance equivalent if they induce the same set of covariance matrices, up to a Lebesgue measure zero set, on the random variables of their associated linear structural equation models. For acyclic graphs,…
The concept of centrally symmetric configurations of integer matrices is introduced. We study the problem when the toric ring of a centrally symmetric configuration is normal as well as is Gorenstein. In addition, Gr\"obner bases of toric…
This paper studies critical ideals of graphs with twin vertices, which are vertices with the same neighbors. A pair of such vertices are called replicated if they are adjacent, and duplicated, otherwise. Critical ideals of graphs having…
Dotsenko and Vallette discovered an extension to nonsymmetric operads of Buchberger's algorithm for Gr\"obner bases of polynomial ideals. In the free nonsymmetric operad with one ternary operation $({\ast}{\ast}{\ast})$, we compute a…
We compute the reduced Gr\"{o}bner basis of the toric ideal with respect to a suitable monomial order and we study the Hilbert series of the vertex cover algebra $A(G)$, where $G$ is an unmixed bipartite graph without isolated vertices.
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 $I_D$ is generalized robust (or weakly robust), then we show that…
We show that if G is a graph of sufficiently large order n containing as many r-cliques as the r-partite Turan graph of order n; then for some C>0 G has more than Cn^(r-1) (r+1)-cliques sharing a common edge unless G is isomorphic to the…
The paper consider an equivalence relation in the set of vertices of a bipartite graph. Some numerical characteristics showing the cardinality of equivalence classes are introduced. A combinatorial identity that is in relationship to these…
We provide necessary and sufficient conditions for simplicial complexes whose determinantal facet ideals admit reduced Grobner bases under diagonal term orders. Building on and extending foundational results for binomial edge ideals and…
The $k$-token graph $T_k(G)$ is the graph whose vertices are the $k$-subsets of vertices of a graph $G$, with two vertices of $T_k(G)$ adjacent if their symmetric difference is an edge of $G$. We explore when $T_k(G)$ is a well-covered…
In this paper we give an explicit and algorithmic description of Graver basis for the toric ideal associated with a simple undirected graph and apply the basis for testing the beta model of random graphs by Markov chain Monte Carlo method.
We study the binomial and monomial ideals arising from linear equivalence of divisors on graphs from the point of view of Gr\"obner theory. We give an explicit description of a minimal Gr\"obner bases for each higher syzygy module. In each…
In this paper, we study toric ideals generated by circuits. For toric ideals which have squarefree quadratic initial ideals, a sufficient condition to be generated by circuits is given. In particular, squarefree Veronese subrings, the…
In this paper, we study ideals spanned by polynomials or overconvergent series in a Tate algebra. With state-of-the-art algorithms for computing Tate Gr{\"o}bner bases, even if the input is polynomials, the size of the output grows with the…
Topological indices are important bridge between graph theory and chemical applications. The study of graph matching expandability has been an influential topic in recent research on graph structure. In this paper, we provide some…
In this paper we extend one direction of Fr\"oberg's theorem on a combinatorial classification of quadratic monomial ideals with linear resolutions. We do this by generalizing the notion of a chordal graph to higher dimensions with the…
Bounds for the maximum degree of a minimal Gr\"obner basis of simplicial toric ideals with respect to the reverse lexicographic order are given. These bounds are close to the bound stated in Eisenbud-Goto's Conjecture on the…
We define toric partial orders, corresponding to regions of graphic toric hyperplane arrangements, just as ordinary partial orders correspond to regions of graphic hyperplane arrangements. Combinatorially, toric posets correspond to finite…
Perfect graphs form one of the distinguished classes of finite simple graphs. In 2006, Chudnovsky, Robertson, Seymour and Thomas proved that a graph is perfect if and only if it has no odd holes and no odd antiholes as induced subgraphs,…
Chordal clutters in the sense of [14] and [3] are defined via simplicial orders. Their circuit ideal has a linear resolution, independent of the characteristic of the base field. We show that any Betti sequence of an ideal with linear…