Related papers: Licci Property of Complementary Edge Ideals
An intuitive property of a random graph is that its subgraphs should also appear randomly distributed. We consider graphs whose subgraph densities exactly match their expected values. We call graphs with this property for all subgraphs with…
Edge expansion is a parameter indicating how well-connected a graph is. It is useful for designing robust networks, analysing random walks or information flow through a network and is an important notion in theoretical computer science.…
We study minimal free resolutions of edge ideals of bipartite graphs. We associate a directed graph to a bipartite graph whose edge ideal is unmixed, and give expressions for the regularity and the depth of the edge ideal in terms of…
In this article, we explore the class of graphs for which the projective dimension of the quotient of the binomial edge ideals matches the big height of that ideal. Additionally, we investigate the Vasconcelos number of binomial edge ideals…
Leibniz algebras are non-antisymmetric generalizations of Lie algebras that have attracted substantial interest due to their close relation with the latter class. A Leibniz algebra $A$ is called perfect if it coincides with its derived…
Let R be a commutative ring with identity. In this paper, we introduce and investigate the second ideal intersection graph SII(R) of R with vertices are non-zero proper ideals of R and two distinct vertices I and J are adjacent if and only…
In this paper we give a new family of complete intersections which have the strong Lefschetz property. The family consists of (Artinian algebras defined by) ideals generated by power sum symmetric polynomials of consecutive degrees and of…
For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…
We investigate straight-line drawings of topological graphs that consist of a planar graph plus one edge, also called almost-planar graphs. We present a characterization of such graphs that admit a straight-line drawing. The…
In this paper we study Eulerian extensions with edge constraints and use the probabilistic method to establish sufficient conditions for a given connected graph to be a subgraph of a Eulerian graph containing $m$ edges, for a given number…
We consider three classes of random graphs: edge random graphs, vertex random graphs, and vertex-edge random graphs. Edge random graphs are Erdos-Renyi random graphs, vertex random graphs are generalizations of geometric random graphs, and…
Working over a field of characteristic zero, we give structure theorems for all grade three licci ideals and their minimal free resolutions. In particular, we completely classify such ideals up to deformation. The descriptions of their…
We determine the Castelnuovo-Mumford regularity of binomial edge ideals of complement reducible graphs (cographs). For cographs with $n$ vertices the maximum regularity grows as $2n/3$. We also bound the regularity by graph theoretic…
In Lombardi drawings of graphs, edges are represented as circular arcs, and the edges incident on vertices have perfect angular resolution. However, not every graph has a Lombardi drawing, and not every planar graph has a planar Lombardi…
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have been made to provide accurate models. We study here a model…
Ideals that share properties with the Frattini ideal of a Leibniz algebra are studied. Similar investigations have been considered in group theory. However most of the results are new for Lie algebras. Many of the results involve nilpotency…
In this paper we study the complementarity spectrum of digraphs, with special attention to the problem of digraph characterization through this complementarity spectrum. That is, whether two non-isomorphic digraphs with the same number of…
We classify all unicycle graphs whose edge-binomials form a $d$-sequence, particularly linear type binomial edge ideals. We also classify unicycle graphs whose parity edge-binomials form a $d$-sequence. We study the regularity of powers of…
Given a base field $\Bbbk$ of characteristic zero, for each graph $G$, we associate the artinian algebra $A(G)$ defined by the edge ideal of $G$ and the squares of the variables. We study the weak Lefschetz property of $A(G)$. We classify…
Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of components, edges and covered components. We prove a…