English
Related papers

Related papers: Spanning Simplicial Ccomplexes of Uni-Cyclic Graph…

200 papers

We classify connected spanning convex subgraphs of the square cycles. We then show that every spanning tree of $C_n^2$ is contained in a unique nontrivial connected spanning convex subgraph of $C_n^2$. As a result, we obtain a purely…

Combinatorics · Mathematics 2023-02-21 Akihiro Munemasa , Yuuho Tanaka

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…

Group Theory · Mathematics 2024-02-12 David G. Costanzo , Mark L. Lewis , Stefano Schmidt , Eyob Tsegaye , Gabe Udell

In the present paper, we investigate the complexity of infinite family of graphs $H_n=H_n(G_1,\,G_2,\ldots,G_m)$ obtained as a circulant foliation over a graph $H$ on $m$ vertices with fibers $G_{1},\,G_{2},\ldots,G_{m}.$ Each fiber…

Combinatorics · Mathematics 2019-02-18 Young Soo Kwon , Alexander Mednykh , Ilya Mednykh

An $r$-uniform hypergraph $H$ consists of a set of vertices $V$ and a set of edges whose elements are $r$-subsets of $V$. We define a hypertree to be a connected hypergraph which contains no cycles. A hypertree spans a hypergraph $H$ if it…

Combinatorics · Mathematics 2020-10-12 Haya S. Aldosari , Catherine Greenhill

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

We solve a problem of Krivelevich, Kwan and Sudakov [SIAM Journal on Discrete Mathematics 31 (2017), 155-171] concerning the threshold for the containment of all bounded degree spanning trees in the model of randomly perturbed dense graphs.…

Combinatorics · Mathematics 2019-02-19 Julia Böttcher , Jie Han , Yoshiharu Kohayakawa , Richard Montgomery , Olaf Parczyk , Yury Person

This paper investigates the shellability of $r$-independence complexes $\mathcal{I}_r(G)$, a generalization of classical independence complexes introduced by Paolini and Salvetti. For a graph $G$, a subset $A \subseteq V(G)$ is…

Combinatorics · Mathematics 2025-09-24 Arka Ghosh , S Selvaraja

We consider Stanley--Reisner rings $k[x_1,...,x_n]/I(\mc{H})$ where $I(\mc{H})$ is the edge ideal associated to some particular classes of hypergraphs. For instance, we consider hypergraphs that are natural generalizations of graphs that…

Commutative Algebra · Mathematics 2015-10-12 Eric Emtander , Fatemeh Mohammadi , Somayeh Moradi

We introduce $k$-robust clique complexes, a family of simplicial complexes that generalizes the traditional clique complex. Here, a subset of vertices forms a simplex provided it does not contain an independent set of size $k$. We…

Combinatorics · Mathematics 2026-04-02 Marek Filakovský

Let $I\subset K[x_1,\ldots,x_n]$ be a zero-dimensional monomial ideal, and $\Delta(I)$ be the simplicial complex whose Stanley--Reisner ideal is the polarization of $I$. It follows from a result of Soleyman Jahan that $\Delta(I)$ is…

Commutative Algebra · Mathematics 2014-12-05 Mina Bigdeli , Jürgen Herzog , Takayuki Hibi , Antonio Macchia

We examine the topology of the clique complexes of the graphs of weakly and strongly separated subsets of the set $[n]=\{1,2,...,n\}$, which, after deleting all cone points, we denote by $\hat{\Delta}_{ws}(n)$ and $\hat{\Delta}_{ss}(n)$,…

Combinatorics · Mathematics 2011-10-06 Daniel Hess , Benjamin Hirsch

The paper studies the connectivity properties of facet graphs of simplicial complexes of combinatorial interest. In particular, it is shown that the facet graphs of $d$-cycles, $d$-hypertrees and $d$-hypercuts are, respectively, $(d+1)$,…

Combinatorics · Mathematics 2015-02-10 Ilan I. Newman , Yuri Rabinovich

In connection with commutative algebra, Bayer et al. introduced cut complexes in [Topology of cut complexes of graphs, SIAM J.\ Discrete Math., 38(2):1630-1675, 2024]. For a positive integer $k$, the $k$-cut complex of a graph $G$, denoted…

Combinatorics · Mathematics 2026-03-25 Pratiksha Chauhan , Samir Shukla

We investigate the shellability of the polyhedral join $\mathcal{Z}^*_M (K, L)$ of simplicial complexes $K, M$ and a subcomplex $L \subset K$. We give sufficient conditions and necessary conditions on $(K, L)$ for $\mathcal{Z}^*_M (K, L)$…

Combinatorics · Mathematics 2022-05-10 Kengo Okura

Hypersimplices are well-studied objects in combinatorics, optimization, and representation theory. For each hypersimplex, we define a new family of subpolytopes, called r-stable hypersimplices, and show that a well-known regular unimodular…

Combinatorics · Mathematics 2016-03-17 Benjamin Braun , Liam Solus

We present a simple method to obtain information regarding the connectivity of the 1-skeleta of a wide family of simplicial complexes through bounds for the Castelnuovo-Mumford regularity of their Stanley-Reisner rings. In this way we…

Combinatorics · Mathematics 2016-12-08 Gabriele Balletti

The $k$-cut complex was recently introduced by Bayer et al. as a generalization of earlier work of Fr{\"o}berg (1990) and Eagon and Reiner (1998), and was shown to be shellable for several classes of graphs. In this article, we prove that…

Combinatorics · Mathematics 2026-02-06 Himanshu Chandrakar

We investigate generalized notions of the nerve complex for the facets of a simplicial complex. We show that the homologies of these higher nerve complexes determine the depth of the Stanley-Reisner ring $k[\Delta]$ as well as the…

Combinatorics · Mathematics 2019-01-30 Hailong Dao , Joseph Doolittle , Ken Duna , Bennet Goeckner , Brent Holmes , Justin Lyle

Let $\Delta$ be a stable simplicial complex on $n$ vertexes. Over an arbitrary base field $K$, the symmetric algebraic shifted complex $\Delta^s$ of $\Delta$ is defined. It is proved that the Betti numbers of the Stanley-Reisner ideals in…

Commutative Algebra · Mathematics 2007-05-23 Zhongming Tang , Guifen Zhuang

We classify weakly connected spanning closed (WCSC) subgraphs of $\overrightarrow{C_n^2}$, the square of a directed $n$-vertex cycle. Then we show that every spanning tree of $\overrightarrow{C_n^2}$ is contained in a unique nontrivial WCSC…

Combinatorics · Mathematics 2026-01-21 Yuuho Tanaka