Related papers: Perfect Matching Complexes of Honeycomb Graphs

{\em Honeycomb toroidal graphs} are a family of cubic graphs determined by a set of three parameters, that have been studied over the last three decades both by mathematicians and computer scientists. They can all be embedded on a torus and…

We consider the well-studied problem of finding a perfect matching in $d$-regular bipartite graphs with $2n$ vertices and $m = nd$ edges. While the best-known algorithm for general bipartite graphs (due to Hopcroft and Karp) takes $O(m…

Bouc (1992) first studied the topological properties of $M_n$, the matching complex of the complete graph of order $n$, in connection with Brown complexes and Quillen complexes. Bj\"{o}rner et al. (1994) showed that $M_n$ is homotopically…

We study the linear extension complexity of stable set polytopes of perfect graphs. We make use of known structural results permitting to decompose perfect graphs into basic perfect graphs by means of two graph operations: 2-join and skew…

A graph is chordal if every cycle of length at least four contains a chord, that is, an edge connecting two nonconsecutive vertices of the cycle. Several classical applications in sparse linear systems, database management, computer vision,…

Given a finite simplicial complex $X$ and a connected graph $T$ of diameter $1$, in \cite{anton} Dochtermann had conjectured that $\text{Hom}(T,G_{1,X})$ is homotopy equivalent to $X$. Here, $G_{1, X}$ is the reflexive graph obtained by…

A Hamilton decomposition of a graph is a partitioning of its edge set into disjoint spanning cycles. The existence of such decompositions is known for all hypercubes of even dimension $2n$. We give a decomposition for the case $n = 2^a3^b$…

The complement of the codimension 2 complex coordinate subspace arrangement is shown to be homotopy equivalent to a wedge of spheres.

Exact sequences are a well known notion in homological algebra. We investigate here the more vague properties of 'homotopical exactness', appearing for instance in the fibre or cofibre sequence of a map. Such notions of exactness can be…

Let H be an r-partite r-graph, all of whose sides have the same size n. Suppose that there exist two sides of H, each satisfying the following condition: the degree of each legal (r-1)-tuple contained in the complement of this side is…

In this paper we investigate invertibility of graphs with a unique perfect matching, i.e. graphs having a unique 1-factor. We recall the new notion of the so-called negatively invertible graphs investigated by the authors in the recent…

For any $\gamma>0$, Keevash, Knox and Mycroft constructed a polynomial-time algorithm to determine the existence of perfect matchings in any $n$-vertex $k$-uniform hypergraph whose minimum codegree is at least $n/k+\gamma n$. We prove a…

A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A simplicial complex $\Delta$ is called pure if all of its facets have the same cardinality. Let $\mathcal G$ be the class of graphs…

We establish a loop space decomposition for certain $CW$-complexes with a single top cell in the presence of a spherical pair, thereby generalizing several known decompositions of Poincar\'{e} duality complexes in which a loop of a product…

A matching $M$ in a graph $\Gamma$ is positive if $\Gamma$ has a vertex-labeling such that $M$ coincides with the set of edges with positive weights. A positive matching decomposition (pmd) of $\Gamma$ is an edge-partition $M_1,\ldots,M_p$…

Schrijver identified a family of vertex critical subgraphs of the Kneser graphs called the stable Kneser graphs $SG_{n,k}$. Bj\"{o}rner and de Longueville proved that the neighborhood complex of the stable Kneser graph $SG_{n,k}$ is…

We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…

In an undirected graph $G=(V,E)$, we say $(A,B)$ is a pair of perfectly matched sets if $A$ and $B$ are disjoint subsets of $V$ and every vertex in $A$ (resp. $B$) has exactly one neighbor in $B$ (resp. $A$). The size of a pair of perfectly…

In the paper we describe the almost split sequences in the homotopy category of perfect complexes over a gentle algebra.

Let p be an odd regular prime, and assume that the Lichtenbaum-Quillen conjecture holds for K(Z[1/p]) at p. Then the p-primary homotopy type of the smooth Whitehead spectrum Wh(*) is described. A suspended copy of the cokernel-of-J spectrum…