English
Related papers

Related papers: Bi-Cohen-Macaulay graphs

200 papers

In this note we give a combinatorial characterization of all the unmixed bipartite graphs.

Combinatorics · Mathematics 2011-04-05 Rafael H. Villarreal

We classify Cohen-Macaulay graphs of girth at least $5$ and planar Gorenstein graphs of girth at least $4$. Moreover, such graphs are also vertex decomposable.

Commutative Algebra · Mathematics 2014-12-17 Dô Trong Hoang , Nguyên Cong Minh , Trân Nam Trung

Chordal graphs and chordal bigraphs enjoy beautiful characterizations, in terms of forbidden subgraphs, vertex/edge orderings, vertex/edge separating sets, and tree-like representations. In this paper, we introduce chordal signed graphs and…

Combinatorics · Mathematics 2026-01-09 Jing Huang , Ying Ying Ye

Unigraphs are graphs identifiable up to isomorphism from their degree sequences. Given a class $\mathcal{A}$ of graphs, we define the class of $\mathcal{A}$-unigraphs to be graphs identifiable from degree sequence and membership in…

Combinatorics · Mathematics 2024-06-07 R. Whitman

In this paper, firstly, we provide some necessary and sufficient conditions for generalized Cayley graphs on abelian groups to be bipartite. Secondly, we deduce several necessary and sufficient conditions for generalized Cayley graphs on…

Combinatorics · Mathematics 2024-12-18 Liao Qianfen , Liu Weijun , Zhang Pengli

A bipartite graph $G=(V,E)$ with $V=V_1\cup V_2$ is biregular if all the vertices of each stable set, $V_1$ and $V_2$, have the same degree, $r$ and $s$, respectively. This paper studies difference sets derived from both Abelian and…

Combinatorics · Mathematics 2024-04-09 G. Araujo-Pardo , C. Dalfó , M. A. Fiol , N. López

Let G be a simple undirected graph on n vertices, and let I(G) \subseteq R = k[x_1,...,x_n] denote its associated edge ideal. We show that all chordal graphs G are sequentially Cohen-Macaulay; our proof depends upon showing that the…

Commutative Algebra · Mathematics 2007-06-13 Christopher A. Francisco , Adam Van Tuyl

Given a finite group $G$ and its representation $\rho$, the corresponding McKay graph is a graph $\Gamma(G,\rho)$ whose vertices are the irreducible representations of $G$; the number of edges between two vertices $\pi,\tau$ of…

Representation Theory · Mathematics 2022-08-02 Avraham Aizenbud , Inna Entova-Aizenbud

We classify the bipartite graphs $G$ whose binomial edge ideal $J_G$ is Cohen-Macaulay. The connected components of such graphs can be obtained by gluing a finite number of basic blocks with two operations. In this context we prove the…

Commutative Algebra · Mathematics 2017-05-09 Davide Bolognini , Antonio Macchia , Francesco Strazzanti

In this paper we show that if the Stanley-Reisner ring of the simplicial complex of independent sets of a bipartite graph $G$ satisfies Serre's condition $S_2$, then $G$ is Cohen-Macaulay. As a consequence, the characterization of…

Commutative Algebra · Mathematics 2010-01-22 Hassan Haghighi , Siamak Yassemi , Rahim Zaare-Nahandi

This paper studies the structure of graphs with given tree-width and excluding a fixed complete bipartite subgraph, which generalises the bounded degree setting. We give a new structural description of such graphs in terms of so-called…

Combinatorics · Mathematics 2025-12-15 Chun-Hung Liu , David R. Wood

We introduce a new subclass of chordal graphs that generalizes split graphs, which we call well-partitioned chordal graphs. Split graphs are graphs that admit a partition of the vertex set into cliques that can be arranged in a star…

Combinatorics · Mathematics 2020-02-26 Jungho Ahn , Lars Jaffke , O-joung Kwon , Paloma T. Lima

A shelling of a graph, viewed as an abstract simplicial complex that is pure of dimension 1, is an ordering of its edges such that every edge is adjacent to some other edges appeared previously. In this paper, we focus on complete bipartite…

Combinatorics · Mathematics 2021-02-11 Yibo Gao , Junyao Peng

For each Boolean graph $B_n$, it is proved that both $B_n$ and its complement graph $\overline{B_n}$ are vertex decomposable. It is also proved that $B_n$ is an unmixed graph, thus it is also Cohen-Macaulay.

Commutative Algebra · Mathematics 2018-04-04 A-Ming Liu , Tongsuo Wu

Let G be a simple undirected graph. We find the number of maximal independent sets in complete t-partite graphs. We will show that vertex decomposability and shellability are equivalent in this graphs. Also, we obtain an equivalent…

Commutative Algebra · Mathematics 2012-05-29 Seyyede Masoome Seyyedi , Farhad Rahmati , Mahdis Saeedi

We study the depth of classes of binomial edge ideals and classify all closed graphs whose binomial edge ideal is Cohen--Macaulay.

Commutative Algebra · Mathematics 2011-07-08 Viviana Ene , Juergen Herzog , Takayuki Hibi

We give a precise description of combed trees in terms of Kelly-Mac Lane graphs. We show that any combed tree is uniquely expressed as an allowable Kelly-Mac Lane graph of a certain shape. Conversely, we show that any such Kelly-Mac Lane…

Category Theory · Mathematics 2007-05-23 Eugenia Cheng

We examine indivisibility for classes of graphs. We show that the class of hereditarily $\alpha$-sparse graphs is indivisible if and only if $\alpha > 2$. Additionally, we show that the following classes of graphs are indivisible: perfect…

Combinatorics · Mathematics 2025-04-09 Vince Guingona , Felix Nusbaum , Zain Padamsee , Miriam Parnes , Christian Pippin , Ava Zinman

In this paper, we investigate odd graceful graph, odd strongly harmonious graph, bipartite graph and their relationship. We proved following results: (1) if G is odd strongly harmonious graph, then G is odd graceful graph ;(2) if G is…

Combinatorics · Mathematics 2020-01-06 Xiuying Wang , Ying Zhoua , Haihong Wanga , Chunfeng Liu

The concept of graph powers has been extensively studied in graph theory. Analogous to graph powers, Chandran et al. [3] introduced the notion of bipartite powers for bipartite graphs. In this paper, we show that the class of interval…

Combinatorics · Mathematics 2025-09-29 Indrajit Paul , Ashok Kumar Das