相关论文: Shellable graphs and sequentially Cohen-Macaulay b…

A bipartite graph is called bipancyclic if it contains cycles of every even length from four up to the number of vertices in the graph. A theorem of Schmeichel and Mitchem states that for $n \geq 4$, every balanced bipartite graph on $2n$…

For several important classes of manifolds acted on by the torus, the information about the action can be encoded combinatorially by a regular n-valent graph with vector labels on its edges, which we refer to as the torus graph. By analogy…

A class of graphs $\mathcal{G}$ is $\chi$-bounded if there exists a function $f$ such that $\chi(G) \leq f(\omega(G))$ for each graph $G \in \mathcal{G}$, where $\chi(G)$ and $\omega(G)$ are the chromatic and clique number of $G$,…

Mixed graphs can be seen as digraphs with arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite and in which the undirected and directed degrees are one. The best graphs,…

We prove that for all $d \geq 1$ a shellable $d$-dimensional simplicial complex with at most $d+3$ vertices is extendably shellable. The proof involves considering the structure of `exposed' edges in chordal graphs as well as a connection…

Via the BGG correspondence a simplicial complex Delta on [n] is transformed into a complex of coherent sheaves on P^n-1. We show that this complex reduces to a coherent sheaf F exactly when the Alexander dual Delta^* is Cohen-Macaulay. We…

The matching complex $M(G)$ of a graph $G$ is the set of all matchings in $G$. A Buchsbaum simplicial complex is a generalization of both a homology manifold and a Cohen--Macaulay complex. We give a complete characterization of the graphs…

Let $G$ be the circulant graph $C_n(S)$ with $S\subseteq\{ 1,\ldots,\left \lfloor\frac{n}{2}\right \rfloor\}$ and let $I(G)$ be its edge ideal in the ring $K[x_0,\ldots,x_{n-1}]$. Under the hypothesis that $n$ is prime we : 1) compute the…

A bipartite graph is chordal bipartite if every cycle of length at least 6 has a chord in it. In this paper, we investigate the structure of $P_5$-free chordal bipartite graphs and show that these graphs have a Nested Neighborhood Ordering,…

A graph $G$ is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function $w$ is defined on its vertices. Then $G$ is $w$-well-covered if all maximal independent sets are of the same weight.…

In a recent paper, Duval, Goeckner, Klivans and Martin disproved the longstanding conjecture by Stanley, that every Cohen-Macaulay simplicial complex is partitionable. We construct counterexamples to this conjecture that are even…

We relate homological properties of a binomial edge ideal $\mathcal{J}_G$ to invariants that measure the connectivity of a simple graph $G$. Specifically, we show if $R/\mathcal{J}_G$ is a Cohen-Macaulay ring, then graph toughness of $G$ is…

In this paper, we study the componentwise linearity of edge ideals of weighted oriented graphs. We show that if $D$ is a weighted oriented graph whose edge ideal $I(D)$ is componentwise linear, then the underlying simple graph $G$ of $D$ is…

In this article, we characterize Cohen-Macaulay permutation graphs. In particular, we show that a permutation graph is Cohen-Macaulay if and only if it is well-covered and there exists a unique way of partitioning its vertex set into $r$…

For each squarefree monomial ideal $I\subset S = k[x_{1},\ldots, x_{n}] $, we associate a simple graph $G_I$ by using the first linear syzygies of $I$. In cases, where $G_I$ is a cycle or a tree, we show the following are equivalent: (a) $…

We show that the facet-ridge graph of a shellable simplicial sphere $\Delta$ uniquely determines the entire combinatorial structure of $\Delta$. This generalizes the celebrated result due to Blind and Mani (1987), and Kalai (1988) on…

Via the BGG-correspondence a simplicial complex D on [n] is transformed into a complex of coherent sheaves L(D) on the projective space n-1-space. In general we compute the support of each of its cohomology sheaves. When the Alexander dual…

It is shown that a flat subgroup, $H$, of the totally disconnected, locally compact group $G$ decomposes into a finite number of subsemigroups on which the scale function is multiplicative. The image, $P$, of a multiplicative semigroup in…

We prove that there is a unique graph with four edges which is the Gruenberg-Kegel graph of a solvable cut group. This contributes to the classification of the Gruenberg-Kegel graphs of solvable cut groups initiated in [A. B\"achle, A.…

For $t\geq 2$, the $t$-independence complex $\mathrm{Ind}_t(G)$ of a graph $G$ is the collection of all $A\subseteq V(G)$ such that each connected component of the induced subgraph $G[A]$ has at most $t-1$ vertices. The topology of…