Related papers: Total cut complexes and their duals
We introduce a new class of simplicial complexes, called \emph{$t$-Young complexes}, arising from a Young diagram and a positive integer~$t$. We show that every $t$-Young complex is either contractible or homotopy equivalent to a wedge of…
Turaev conjectured that the classification, realization and splitting results for Poincar\'e duality complexes of dimension $3$ (PD$_{3}$-complexes) generalize to PD$_{n}$-complexes with $(n-2)$-connected universal cover for $n \ge 3$.…
The {\em perfect matching complex} of a graph is the simplicial complex on the edge set of the graph with facets corresponding to perfect matchings of the graph. This paper studies the perfect matching complexes, $\mathcal{M}_p(H_{k \times…
We work over an arbitrary ring R. Given two truncated projective resolutions of equal length for the same module we consider their underlying chain complexes. We show they may be stabilized by projective modules to obtain a pair of…
For a graph $G$, Bayer-Denker-Milutinovi\'c-Rowlands-Sundaram-Xue study in \cite{B-D-M-R-S-X} a new graph complex $\Delta_k^t(G)$, namely the simplicial complex with facets that are complements to independent sets of size $k$ in $G$. They…
A $2$-matching complex is a simplicial complex which captures the relationship between $2$-matchings of a graph. In this paper, we will use discrete Morse Theory and the Matching Tree Algorithm to prove homotopical results. We will consider…
Recently there has been growing interest in discrete homotopies and homotopies of graphs beyond treating graphs as 1-dimensional simplicial spaces. One such type of homotopy is $\times$-homotopy. Recent work by Chih-Scull has developed a…
A cut in a digraph $D=(V,A)$ is a set of arcs $\{uv \in A: u\in U, v\notin U\}$, for some $U\subseteq V$. It is known that the arc set $A$ is covered by $k$ cuts if and only if it admits a $k$-coloring such that no two consecutive arcs $uv,…
Confirming a conjecture of Gy\'arf\'as, we prove that, for all natural numbers $k$ and $r$, the vertices of every $r$-edge-coloured complete $k$-uniform hypergraph can be partitioned into a bounded number (independent of the size of the…
Let $R$ be any ring with identity. We show that the homotopy category of all acyclic chain complexes of pure-projective $R$-modules is a compactly generated triangulated category. We do this by constructing abelian model structures that put…
We describe spectral model category structures on the categories of cyclotomic spectra and $p$-cyclotomic spectra (in orthogonal spectra) with triangulated homotopy categories. We show that the functors $TR$ and $TC$ are corepresentable in…
We introduce notions of {\it upper chernrank} and {\it even cup length} of a finite connected CW-complex and prove that {\it upper chernrank} is a homotopy invariant. It turns out that determination of {\it upper chernrank} of a space $X$…
The homotopy theory of gauge groups has received considerable attention in recent decades. In this work, we study the homotopy theory of gauge groups over some high dimensional manifolds. To be more specific, we study gauge groups of…
We continue our investigation of spaces of long embeddings (long embeddings are high-dimensional analogues of long knots). In previous work we showed that when the dimensions are in the stable range, the rational homology groups of these…
Let $k$ be a field of positive characteristic $p$, and $X$ be a separated of finite type $k$-scheme of dimension $d$. We construct a cycle map from the additive cycle complex to the residual complex of Serre-Grothendieck coherent duality…
Let $D_{n,\gamma}$ be the complex of graphs on $n$ vertices and domination number at least $\gamma$. We prove that $D_{n,n-2}$ has the homotopy type of a finite wedge of 2-spheres. This is done by using discrete Morse theory techniques.…
For a graph $G$ on $[n]$, the $k$-cut complex $\Delta_k(G)$ has facets $[n]\setminus T$, where $T$ ranges over the disconnected $k$-vertex induced subgraphs of $G$. Bayer, Denker, Jeli\'c Milutinovi\'c, Sundaram, and Xue proved that the…
Perfect Matching-Cut is the problem of deciding whether a graph has a perfect matching that contains an edge-cut. We show that this problem is NP-complete for planar graphs with maximum degree four, for planar graphs with girth five, for…
In this paper, we investigate the well-studied Hamiltonian cycle problem (HCYCLE), and present an interesting dichotomy result on split graphs. T. Akiyama et al. (1980) have shown that HCYCLE is NP-complete in planar bipartite graphs with…
The aim of this paper is to explain how, through the work of a number of people, some algebraic structures related to groupoids have yielded algebraic descriptions of homotopy n-types. Further, these descriptions are explicit, and in some…