Related papers: The cubical matching complex revisited

For a planar graph with a given f-vector $(f_{0}, f_{1}, f_{2}),$ we introduce a cubic polynomial whose coefficients depend on the f-vector. The planar graph is said to be real if all the roots of the corresponding polynomial are real. Thus…

We introduce a class of graphs called compound graphs, generalizing rectangles, which are constructed out of copies of a planar bipartite base graph. The main result is that the number of perfect matchings of every compound graph is…

In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…

The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular subgraph and a matching. We show that this conjecture holds for the class of connected plane cubic graphs.

We derive a simple bijection between geometric plane perfect matchings on $2n$ points in convex position and triangulations on $n+2$ points in convex position. We then extend this bijection to monochromatic plane perfect matchings on…

A general position map $f:K\to M$ of a $k$-dimensional simplicial complex to a $2k$-dimensional manifold (for $k=1$, of a graph to a surface) is a $\mathbb Z_2$-embedding if $|f\sigma \cap f\tau|$ is even for any non-adjacent $k$-faces…

For Hamiltonian circle actions on compact, connected, four-dimensional manifolds, we give a generators and relations description for the even part of the equivariant cohomology, as an algebra over the equivariant cohomology of a point. This…

Let $\mathcal{H}$ be a connected hereditary abelian category with tilting objects. It is proved that the cluster-tilting graph associated with $\mathcal{H}$ is always connected. As a consequence, we establish the connectedness of the…

This note is devoted to a trick which yields almost trivial proofs that certain complexes associated to topological surfaces are connected or simply connected. Applications include new proofs that the complexes of curves, separating curves,…

A graph $G$ is called matching covered if all of its edges are contained in some perfect matching of $G$. Furthermore, a cycle $C \subseteq G$ is called conformal if $G - V(C)$ has a perfect matching and $G$ itself is called cycle-conformal…

In the field of the Jacobian conjecture it is well-known after Druzkowski that from a polynomial "cubic-homogeneous" mapping we can build a higher-dimensional "cubic-linear" mapping and the other way round, so that one of them is invertible…

When does the double cover of the three-sphere branched along an alternating link bound a rational homology ball? Heegaard Floer homology generates a necessary condition for it to bound: the link's chessboard lattice must be cubiquitous,…

In this paper, we introduce a corresponding between bipartite graphs with a perfect matching and digraphs, which implicates an equivalent relation between the extendibility of bipartite graphs and the strongly connectivity of digraphs. Such…

In [BNRR], it was shown that tiling of general regions with two rectangles is NP-complete, except for a few trivial special cases. In a different direction, R\'emila showed that for simply connected regions by two rectangles, the…

The symmetries of complex molecular structures can be modeled by the {\em topological symmetry group} of the underlying embedded graph. It is therefore important to understand which topological symmetry groups can be realized by particular…

We show that c-planarity is solvable in quadratic time for flat clustered graphs with three clusters if the combinatorial embedding of the underlying graph is fixed. In simpler graph-theoretical terms our result can be viewed as follows.…

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…

A matching $M$ in a graph $G$ is uniquely restricted if no other matching in $G$ covers the same set of vertices. We conjecture that every connected subcubic graph with $m$ edges and $b$ bridges that is distinct from $K_{3,3}$ has a…

We study finite foldable cubical complexes of nonpositive curvature (in the sense of A.D. Alexandrov). We show that such a complex X admits a graph of spaces decomposition. It is also shown that when dim X=3, X contains a closed rank one…

We introduce the notion of coupled embeddability, defined for maps on products of topological spaces. We use known results for nonsingular biskew and bilinear maps to generate simple examples and nonexamples of coupled embeddings. We study…