Related papers: Manifold Matching Complexes
A matching cut is a matching that is also an edge cut. In the problem Minimum Matching Cut, we ask for a matching cut with the minimum number of edges in the matching. We investigate the differences in complexity between Minimum Matching…
A perfect matching in a 3-uniform hypergraph on $n=3k$ vertices is a subset of $\frac{n}{3}$ disjoint edges. We prove that if $H$ is a 3-uniform hypergraph on $n=3k$ vertices such that every vertex belongs to at least ${n-1\choose 2} -…
The maximum matching width is a width-parameter that is defined on a branch-decomposition over the vertex set of a graph. The size of a maximum matching in the bipartite graph is used as a cut-function. In this paper, we characterize 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…
Energy minimizing harmonic maps between manifolds are known to be smooth outside a rectifiable set of codimension $3$, called the singular set. The possibility that this set is not a manifold, but has arbitrarily many small gaps in it, is…
In this paper we define spherical complexes as simplicial complexes with the property that every subcomplex obtained by a sequence of links and deletions either has trivial homology, or has the homology of a sphere. Examples of such…
A shelling of a graph, viewed as an abstract simplicial complex that is pure of dimension 1, is an ordering of its edges such that every edge is adjacent to some other edges appeared previously. In this paper, we focus on complete bipartite…
This paper studies non-crossing geometric perfect matchings. Two such perfect matchings are \emph{compatible} if they have the same vertex set and their union is also non-crossing. Our first result states that for any two perfect matchings…
The $g$-vector of a simplicial complex contains a lot of information about the combinatorial and topological structure of that complex. Several classification results regarding the structure of normal pseudomanifolds and homology manifolds…
We study closed orientable manifolds whose topological complexity is at most 3 and determine their cohomology rings. For some of admissible cohomology rings we are also able to identify corresponding manifolds up to homeomorphism.
A connected matching in a graph G consists of a set of pairwise disjoint edges whose covered vertices induce a connected subgraph of G. While finding a connected matching of maximum cardinality is a well-solved problem, it is NP-hard to…
Let $\mathcal{P}$ be a set of $n=2m+1$ points in the plane in general position. We define the graph $GM_\mathcal{P}$ whose vertex set is the set of all plane matchings on $\mathcal{P}$ with exactly $m$ edges. Two vertices in…
Perfect matchings and maximum weight matchings are two fundamental combinatorial structures. We consider the ratio between the maximum weight of a perfect matching and the maximum weight of a general matching. Motivated by the computer…
In this paper we introduce a path complex that can be regarded as a generalization of the notion of a simplicial complex. The main motivation for considering path complexes comes from directed graphs(digraphs). We obtain a new notion of the…
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…
We show that round hemispheres are the only compact 2 dimensional Riemannian manifolds (with or without boundary) such that almost every pair of complete geodesics intersect once and only once. We prove this by establishing a sharp…
In this paper we study the main characteristics of some evaluation codes parameterized by the edges of a bipartite graph with a perfect matching.
If f maps a discrete d-manifold G onto a (k+1)-partite complex P then H(G,f,P),the set of simplices x in G such that f(x) contains at least one facet in P defines a (d-k)-manifold.
The Centre Symmetry Set of a planar curve $M$ is the envelope of affine chords of $M$, i.e. the lines joining points on $M$ with parallel tangent lines. In this paper we study global geometrical properties of this set including the number…
We consider the line graph of a pure simplicial complex. We prove that, as in the case of line graphs of simple graphs, one can compute the second graded Betti number of the facet ideal of a pure simplicial complex in terms of the…