English
Related papers

Related papers: Bipartite $S_2$ graphs are Cohen-Macaulay

200 papers

We propose a generalization of the concept of a Ribbon graph suitable to provide combinatorial models for marked surfaces equipped with a G-structure. Our main insight is that the necessary combinatorics is neatly captured in the concept of…

Algebraic Topology · Mathematics 2021-06-01 Tobias Dyckerhoff , Mikhail Kapranov

In 2019, P. Higgins formulated [1] a question about bipartite graphs (see Conjecture 1 below); this question arises in the study of regular finite semigroups. F. V. Petrov formulated [2] another combinatorial conjecture (Conjecture 3);…

Combinatorics · Mathematics 2026-03-20 Ilya I. Bogdanov , Fedor Petrov , Anton Sadovnichiy , Fedor Ushakov

Let $G$ be a finite simple graph with edge ideal $I(G)$. For $q\ge 1$, the $q$-th squarefree power $I(G)^{[q]}$ is generated by products of $q$ pairwise disjoint edges of $G$. It is the Stanley-Reisner ideal of a simplicial complex…

Commutative Algebra · Mathematics 2026-03-11 Rakesh Ghosh , S Selvaraja

The canonical double cover $B(X)$ of a graph $X$ is the direct product of $X$ and $K_2$. If $Aut(B(X)) \cong Aut(X) \times \mathbb{Z}_2$ then $X$ is called stable; otherwise $X$ is called unstable. An unstable graph is nontrivially unstable…

Combinatorics · Mathematics 2022-01-11 Blas Fernandez , Ademir Hujdurović

Biregular bipartite graphs have been proven to have similar edge distributions to random bipartite graphs and thus have nice pseudorandomness and expansion properties. Thus it is quite desirable to find a biregular bipartite spanning…

Combinatorics · Mathematics 2024-10-29 Dandan Fan , Xiaofeng Gu , Huiqiu Lin

Consider a graph with $n$ vertices where the shortest odd cycle is of length $>2k+1$. We revisit two known results about such graphs: (I) Such a graph is almost bipartite, in the sense that it can be made bipartite by removing from it…

Discrete Mathematics · Computer Science 2018-10-05 Sariel Har-Peled , Saladi Rahul

For a standard graded Cohen-Macaulay ring $S$, if the quotient $S/(\underline{x})$ admits non-free totally reflexive modules, where $\underline{x}$ is a system of parameters consisting of elements of degree one, then so does the ring $S$.…

Commutative Algebra · Mathematics 2019-05-24 Cameron Atkins , Adela Vraciu

In this paper we investigate the bipartite analogue of the strong Erdos-Hajnal property. We prove that for every forest $H$ and every $\tau>0$ there exists $\epsilon>0$, such that if $G$ has a bipartition $(A,B)$ and does not contain $H$ as…

Combinatorics · Mathematics 2023-03-06 Alex Scott , Paul Seymour , Sophie Spirkl

We extend the notion of face rings of simplicial complexes and simplicial posets to the case of finite-length (possibly infinite) simplicial posets with a group action. The action on the complex induces an action on the face ring, and we…

Combinatorics · Mathematics 2021-11-30 Alessio D'Alì , Emanuele Delucchi

A graph $G$ admiting a $2$-factor is \textit{pseudo $2$-factor isomorphic} if the parity of the number of cycles in all its $2$-factors is the same. In [M. Abreu, A.A. Diwan, B. Jackson, D. Labbate and J. Sheehan. Pseudo $2$-factor…

Combinatorics · Mathematics 2022-07-25 M. Abreu , M. Funk , D. Labbate , F. Romaniello

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…

Algebraic Geometry · Mathematics 2011-12-14 Gunnar Floystad , Jon Eivind Vatne

We introduce a class of chordal graphs called ($d_1$,$d_2$,$\dots$,$d_q$)-trees. A graph belongs to this class if and only if its clique complex is sequentially Cohen-Macaulay, providing a complete classification of all sequentially…

Commutative Algebra · Mathematics 2025-10-14 Chwas Ahmed , Amir Mafi , Mohammed Rafiq Namiq

It is well-known that eigenvalues of graphs can be used to describe structural properties and parameters of graphs. A theorem of Nosal states that if $G$ is a triangle-free graph with $m$ edges, then $\lambda (G)\le \sqrt{m}$, equality…

Combinatorics · Mathematics 2022-10-17 Yongtao Li , Yuejian Peng

Let s<t be two fixed positive integers. We study what are the minimum degree conditions for a bipartite graph G, with both color classes of size n=k(s+t), which ensure that G has a K_{s,t}-factor. Exact result for large n is given. Our…

Combinatorics · Mathematics 2017-07-31 Jan Hladky , Mathias Schacht

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

A graph $X$ is 2-spanning cyclable if for any pair of distinct vertices $u$ and $v$ there is a 2-factor of $X$ consisting of two cycles such that $u$ and $v$ belong to distinct cycles. In this paper we examine the 2-spanning cyclability of…

Combinatorics · Mathematics 2023-09-12 Brian Alspach , Aditya Joshi

The bipartite-hole-number of a graph $G$, denoted by $\widetilde{\alpha}(G)$, is the minimum number $k$ such that there exist positive integers $s$ and $t$ with $s+t=k+1$ with the property that for any two disjoint sets $A,B\subseteq V(G)$…

Combinatorics · Mathematics 2025-11-21 Kun Cheng , Yurui Tang

A bridgeless cubic graph $G$ is said to have a 2-bisection if there exists a 2-vertex-colouring of $G$ (not necessarily proper) such that: (i) the colour classes have the same cardinality, and (ii) the monochromatic components are either an…

Combinatorics · Mathematics 2022-09-16 Jean Paul Zerafa

In this paper we are interested in the asymptotic enumeration of bipartite Cayley digraphs and Cayley graphs over abelian groups. Let $A$ be an abelian group and let $\iota$ be the automorphism of $A$ defined by $a^\iota=a^{-1}$, for every…

Combinatorics · Mathematics 2020-01-16 Jia-Li Du , Yan-Quan Feng , Pablo Spiga

We say that a bipartite graph $G(A, B)$ with fixed parts $A$, $B$ is proximinal if there is a semimetric space $(X, d)$ such that $A$ and $B$ are disjoint proximinal subsets of $X$ and all edges $\{a, b\}$ satisfy the equality $d(a, b) =…

Combinatorics · Mathematics 2022-01-24 Karim Chaira , Oleksiy Dovgoshey , Samih Lazaiz
‹ Prev 1 8 9 10 Next ›