Related papers: 2-Matching Complexes
In this paper, we prove that the Max-Morse Matching Problem is approximable, thus resolving an open problem posed by Joswig and Pfetsch. We describe two different approximation algorithms for the Max-Morse Matching Problem. For…
We prove that the complement of any affine 2-arrangement in R^d is minimal, that is, it is homotopy equivalent to a cell complex with as many i-cells as its i-th rational Betti number. For the proof, we provide a Lefschetz-type hyperplane…
We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between…
We present a complete acyclic matching of the Hasse diagram associated with the face lattice of a hypersimplex. Since a hypersimplex is a convex polytope, there is a natural way to form a CW complex from its faces. We will then utilize this…
We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and…
Intuitively speaking, a bipartite graph is mirror if it can be drawn in the Cartesian plane in such a way that, the vertices of one stable are points in x=0, the vertices of the other stable set are points in x=1, the edges are straight…
In a graph, a matching cut is an edge cut that is a matching. Matching Cut is the problem of deciding whether or not a given graph has a matching cut, which is known to be NP-complete even when restricted to bipartite graphs. It has been…
We show that any pasting diagram in any $(\infty,2)$-category has a homotopically unique composite. This is achieved by showing that the free 2-category generated by a pasting scheme is the homotopy colimit of its cells as an…
We investigate in detail a homomorphism which we call the 2-Selmer signature map from the $2$-Selmer group of a number field $K$ to a nondegenerate symmetric space, in particular proving the image is a maximal totally isotropic subspace.…
In this paper, the problem of matching pairs of correlated random graphs with multi-valued edge attributes is considered. Graph matching problems of this nature arise in several settings of practical interest including social network…
The homotopy type of the complement of a complex coordinate subspace arrangement is studied by fathoming out the connection between its topological and combinatorial structures. A family of arrangements for which the complement is homotopy…
We introduce a novel combinatorial method to study $Q^{**}$-transformations of group presentations or, equivalently, 3-deformations of CW-complexes of dimension 2. Our procedure is based on a refinement of discrete Morse theory that gives a…
A moplex is a natural graph structure that arises when lifting Dirac's classical theorem from chordal graphs to general graphs. While every non-complete graph has at least two moplexes, little is known about structural properties of graphs…
Elementary geometric arguments are used to compute the group of homotopy classes of maps from a 4-manifold X to the 3-sphere, and to enumerate the homotopy classes of maps from X to the 2-sphere. The former completes a project initiated by…
We prove that if a simplicial complex is shellable, then the intersection lattice for the corresponding diagonal arrangement is homotopy equivalent to a wedge of spheres. Furthermore, we describe precisely the spheres in the wedge, based on…
Let $X_{2k}$ be a set of $2k$ labeled points in convex position in the plane. We consider geometric non-intersecting straight-line perfect matchings of $X_{2k}$. Two such matchings, $M$ and $M'$, are disjoint compatible if they do not have…
The NP-complete problem Matching Cut is to decide if a graph has a matching that is also an edge cut of the graph. We prove new complexity results for Matching Cut restricted to $H$-free graphs, that is, graphs that do not contain some…
Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…
For a symmetric 2t-cycle in the tope graph of a simple oriented matroid M on the ground set {1,...,t}, where t is even, we describe decompositions of topes and subtopes of M with respect to the subtopes corresponding to the edges of the…
Discrete homotopy theory or A-homotopy theory is a combinatorial homotopy theory defined on graphs, simplicial complexes, and metric spaces, reflecting information about their connectivity. The present paper aims to further understand the…