Related papers: 2-Matching Complexes

A crossed module constitutes a strict $2$-groupoid $\mathcal{G}$ and a $\mathcal{G}$-valued cocycle on a manifold defines a $2$-bundle. A $2$-connection on this $2$-bundle is given by a Lie algebra $\mathfrak g$ valued $1$-form $A $ and a…

We address the homotopy theory of 2-crossed modules of commutative algebras. In particular, we define the concept of a 2-fold homotopy between a pair of 1-fold homotopies connecting 2-crossed module maps $\A \to \A'$. We also prove that if…

Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…

We associate to each real algebraic variety a filtered chain complex, the weight complex, which is well-defined up to filtered quasi-isomorphism, and which induces on classical (compactly supported) homology with Z/2 coefficients an analog…

A triangle-free (simple) 2-matching is an edge set that has at most $2$ edges incident to each vertex and contains no cycle of length $3$. For the problem of finding a maximum cardinality triangle-free 2-matching in a given graph, a…

The Hom complex $\mathrm{Hom}(G, H)$ of graphs is a simplicial complex associated to a pair of graphs $G$ and $H$, and its homotopy type is of interest in the graph coloring problem and the homomorphism reconfiguration problem. In this…

Let $\Gamma$ be a finite, undirected, connected, simple graph. We say that a matching $\mathcal{M}$ is a \textit{permutable $m$-matching} if $\mathcal{M}$ contains $m$ edges and the subgroup of $\text{Aut}(\Gamma)$ that fixes the matching…

Two plane drawings of graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. Let $S$ be a convex point set of $2n \geq 10$ points and let $\mathcal{H}$ be a family of…

Topological data analysis can reveal higher-order structure beyond pairwise connections between vertices in complex networks. We present a new method based on discrete Morse theory to study topological properties of unweighted and…

A graph G is a 2-tree if G=K_3, or G has a vertex v of degree 2, whose neighbours are adjacent, and G\v{i}s a 2-tree. A characterization of the degree sequences of 2-trees is given. This characterization yields a linear-time algorithm for…

Given a homotopy connecting two polynomial systems we provide a rigorous algorithm for tracking a regular homotopy path connecting an approximate zero of the start system to an approximate zero of the target system. Our method uses recent…

Crossed modules are known to be a model of pointed connected homotopy 2-types; formally, the homotopy category of crossed modules is equivalent to the category of pointed connected homotopy 2-types. In forming the homotopy category of…

Let p be a singular point of a variety. Consider a resolution where the preimage of p is a simple normal crossing divisor E. The combinatorial structure of E is described by a cell complex D(E), called the dual graph or dual complex of E.…

We introduce a filtration on the simplicial homology of a finite simplicial complex X using bi-colourings of its vertices. This yields two dual homology theories closely related to discrete Morse matchings on X. We give an explicit…

We construct a simplicial complex, the rectangle complex of a relation R, and show that it is homotopy equivalent to the Dowker complex of R. This results in a short and conceptual proof of functorial versions of Dowker's Theorem used in…

In this article we consider the homotopy theory of stratified spaces through a simplicial point of view. We first consider a model category of filtered simplicial sets over some fixed poset $P$, and show that it is a simplicial…

For a graph $G=(V,E),$ a matching $M$ is a set of independent edges. The topic of matchings is well studied in graph theory. In this paper many varieties of matchings are discussed.

In this paper, we consider a simple class of stratified spaces -- 2-complexes. We present an algorithm that learns the abstract structure of an embedded 2-complex from a point cloud sampled from it. We use tools and inspiration from…

Graph matching aims to establish correspondences between vertices of graphs such that both the node and edge attributes agree. Various learning-based methods were recently proposed for finding correspondences between image key points based…

For a connected graph, a path containing all vertices is known as \emph{Hamiltonian path}. For general graphs, there is no known necessary and sufficient condition for the existence of Hamiltonian paths and the complexity of finding a…