Related papers: Matching arc complexes: connectedness and hyperbol…
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
In this paper, we investigate a family of graphs associated to collections of arcs on surfaces. These {\it multiarc graphs} naturally interpolate between arc graphs and flip graphs, both well studied objects in low dimensional geometry and…
Given a simplicial complex $\Delta$, we investigate how to construct a new simplicial complex $\bar{\Delta}$ such that the corresponding monomial ideals satisfy nice algebraic properties. We give a procedure to check the vertex…
We prove that every finite group is the orientation-preserving isometry group of the complement of a hyperbolic link in the 3-sphere.
Let G be a group acting geometrically on a CAT(0) cube complex X. We prove first that G is hyperbolic relative to the collection P of subgroups if and only if the simplicial boundary of X is the disjoint union of a nonempty discrete set,…
In an earlier work, finite groups whose power graphs are minimally edge connected have been classified. In this article, first we obtain a necessary and sufficient condition for an arbitrary graph to be minimally edge connected.…
Haxell's condition is a natural hypergraph analog of Hall's condition, which is a well-known necessary and sufficient condition for a bipartite graph to admit a perfect matching. That is, when Haxell's condition holds it forces the…
The main technical result of this paper is to characterize the contracting isometries of a CAT(0) cube complex without any assumption on its local finiteness. Afterwards, we introduce the combinatorial boundary of a CAT(0) cube complex, and…
We consider a random geometric hypergraph model based on an underlying bipartite graph. Nodes and hyperedges are sampled uniformly in a domain, and a node is assigned to those hyperedges that lie with a certain radius. From a modelling…
We prove that the free splitting complex of a finite rank free group, also known as Hatcher's sphere complex, is hyperbolic.
We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…
Sufficient conditions are given for the computation of accessing arcs and arcs that links boundary components of multiply connected domains. The existence of a not-computably-accessible but computable point on a computably compact arc is…
Recent work showing the existence of conflict-free almost-perfect hypergraph matchings has found many applications. We show that, assuming certain simple degree and codegree conditions on the hypergraph $ \mathcal{H} $ and the conflicts to…
We prove that almost all arc complexes do not admit a CAT(0) metric with finitely many shapes, in particular any finite-index subgroup of the mapping class group does not preserve such a metric on the arc complex. We also show the analogous…
Let $G$ be a right-angled Artin group with defining graph $\Gamma$ and let $H$ be a finitely generated group quasi-isometric to $G(\Gamma)$. We show if $G$ satisfies (1) its outer automorphism group is finite; (2) $\Gamma$ does not have…
We study conditions under which an edge-coloured hypergraph has a particular substructure that contains more than the trivially guaranteed number of monochromatic edges. Our main result solves this problem for perfect matchings under…
This paper proves the existence of a chiral map with alternating automorphism group for every hyperbolic type. We present a set of constructions using permutations for when at least one parameter is even, and call on previously known…
We develop a formalism that allows us to describe Markov compacta with finite sets of diagrams that are building blocks of the entire sequence. This encodes complex, continuous spaces with discrete collections of combinatorial objects. We…
A matching $M$ in a graph $G$ is connected if all the edges of $M$ are in the same component of $G$. Following \L uczak,there have been many results using the existence of large connected matchings in cluster graphs with respect to regular…
Two planar embedded circle patterns with the same combinatorics and the same intersection angles can be considered to define a discrete conformal map. We show that two locally finite circle patterns covering the unit disc are related by a…