Related papers: Analytic spread of binomial edge ideals
Let $G$ be a simple graph on $n$ vertices and $J_G$ denote the corresponding binomial edge ideal in $S = K[x_1, \ldots, x_n, y_1,\ldots, y_n].$ We prove that the Castelnuovo-Mumford regularity of $J_G$ is bounded above by $c(G)+1$ when $G$…
We show that the universal Gr\"obner basis and the Graver basis of a binomial edge ideal coincide. We provide a description for this basis set in terms of certain paths in the underlying graph. We conjecture a similar result for a parity…
Let $G$ be a simple graph on $n$ vertices and $J_G$ denote the binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1, \ldots, x_n, y_1, \ldots, y_n].$ In this article, we compute the second graded Betti numbers of $J_G$, and…
In this thesis we investigate certain types of monomial ideals of polynomial rings over fields. We are interested in minimal free resolutions of these ideals (or equivalently the quotients of the polynomial ring by the ideals) considered as…
We study the Stanley depth and the Hilbert depth of the edge ideals of path graphs, cycle graphs, generalized star graphs and double broom graphs.
Sampling algorithms, hypergraph degree sequences, and polytopes play a crucial role in statistical analysis of network data. This article offers a brief overview of open problems in this area of discrete mathematics from the point of view…
We give an upper bound for the Stanley depth of the edge ideal $I$ of a $k$-partite complete graph and show that Stanley's conjecture holds for $I$. Also we give an upper bound for the Stanley depth of the edge ideal of a $k$-uniform…
We calculate explicit formulae for the Shannon entropies of several families of tailored random graph ensembles for which no such formulae were as yet available, in leading orders in the system size. These include bipartite graph ensembles…
Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…
In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…
The edge-degeneracy model is an exponential random graph model that uses the graph degeneracy, a measure of the graph's connection density, and number of edges in a graph as its sufficient statistics. We show this model is relatively…
Binomial edge ideals associated to a simple graph G were introduced by Herzog and collaborators and, independently, by Ohtani. They became an ``instant classic" in combinatorial commutative algebra with more than 100 papers devoted to their…
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…
Let $G$ be the circulant graph $C_n(S)$ with $S \subseteq \{1, 2, \dots, \lfloor \frac{n}{2} \rfloor\}$, and let $I(G)$ denote the edge ideal in the polynomial ring $R=\mathbb{K}[x_0, x_1, \dots, x_{n-1}]$ over a field $\mathbb{K}$. In this…
In the sufficiently sparse case, we find the probability that a uniformly random bipartite graph with given degree sequence contains no edge from a specified set of edges. This enables us to enumerate loop-free digraphs and oriented graphs…
It is not hard to find many complete bipartite graphs which are not determined by their spectra. We show that the graph obtained by deleting an edge from a complete bipartite graph is determined by its spectrum. We provide some graphs, each…
In this paper we study the $s$-th symbolic powers of the edge ideals of complete graphs. In particular, we provide a criterion for finding an Eliahou-Kervaire splitting on these ideals, and use the splitting to provide a description for the…
Associated to any hypergraph is a toric ideal encoding the algebraic relations among its edges. We study these ideals and the combinatorics of their minimal generators, and derive general degree bounds for both uniform and non-uniform…
We characterize the bipartite graphs that minimize the (first-degree based) entropy, among all bipartite graphs of given size, or given size and (upper bound on the) order. The extremal graphs turn out to be complete bipartite graphs, or…
We present two new problems on lower bounds for resolution Betti numbers of monomial ideals generated in a fixed degree. The first concerns any such ideal and bounds the total Betti numbers, while the second concerns ideals that are…