Related papers: Manifold Matching Complexes
A smooth map between manifolds is said to be \emph{image simple} if its restriction to its singular point set is a topological embedding. We study the parity of the number of connected components of the singular point set for image simple…
In this paper we outline a setup for Homological Mirror Symmetry for manifolds of general type. Both Physics and Categorical perspectives are considered.
A conjecture of Berge suggests that every bridgeless cubic graph can have its edges covered with at most five perfect matchings. Since three perfect matchings suffice only when the graph in question is $3$-edge-colourable, the rest of cubic…
In this paper we systematically describe relations between various structure sets which arise naturally for pairs of compact topological manifolds with boundary. Our consideration is based on a deep analogy between the case of a compact…
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$…
The independence complex of a graph G is a simplicial complex whose simplices are the independent sets in G. In the last couple of decades, the independence complexes of square grids (with various boundary conditions) have gained much…
The fine curve complex of a surface is a simplicial complex whose vertices are essential simple closed curves and whose $k$-simplices are collections of $k+1$ disjoint curves. We prove that the fine curve complex is homotopy equivalent to…
A simplicial polytope is a polytope with all its facets being combinatorially equivalent to simplices. We deal with the edge connectivity of the graphs of simplicial polytopes. We first establish that, for any $d\ge 3$, for any $d\ge 3$,…
We provide a characterisation of all graphs whose parity binomial edge ideals have pure resolutions. In particular, we show that the minimal free resolution of a parity binomial edge ideal is pure if and only if the corresponding graph is a…
The dual complex of a singularity is defined, up-to homotopy, using resolutions of singularities. In many cases, for instance for isolated singularities, we identify and study a "minimal" representative of the homotopy class that is well…
In this paper, we provide a simple proof for the fact that two simplicial complexes are isomorphic if and only if their associated Stanley-Reisner rings, or their associated facet rings are isomorphic as $K$-algebras. As a consequence, we…
A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths…
In this paper we describe the complement of real line arrangements in the complex plane in terms of the boundary three-manifold of the line arrangement. We show that the boundary manifold of any line arrangement is a graph manifold with…
A geometric graph is a graph drawn in the plane so that its vertices and edges are represented by points in general position and straight line segments, respectively. A vertex of a geometric graph is called pointed if it lies outside of the…
A simple topological graph $G$ is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. $G$ is called saturated if no further edge can be added without…
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how to compare graphs. This problem is often formulated as a…
A mixed graph is a graph with some directed edges and some undirected edges. We introduce the notion of mixed matroids as a generalization of mixed graphs. A mixed matroid can be viewed as an oriented matroid in which the signs over a fixed…
We show that the number of perfect matching in a simple graph $G$ with an even number of vertices and degree sequence $d_1,d_2, ..., d_n$ is at most $\prod_{i=1}^n (d_i !)^{\frac{1}{2d_i}}$. This bound is sharp if and only if $G$ is a union…
Let $r$ be a positive integer. An $r$-set is a pair $X= (V(X),R(X))$ consisting of a set $V(X)$ with a subset $R(X)$ of the direct product $V(X)^r$. The object of this paper is to investigate the Hom complexes of $r$-sets, which were…
A perfect matching in a graph $G$ is a set of nonadjacent edges covering every vertex of $G$. Motivated by recent progress on the relations between the eigenvalues and the matching number of a graph, in this paper, we aim to present a…