Related papers: Matching arc complexes: connectedness and hyperbol…

Let $G$ be a graph with the usual shortest-path metric. A graph is $\delta$-hyperbolic if for every geodesic triangle $T$, any side of $T$ is contained in a $\delta$-neighborhood of the union of the other two sides. A graph is chordal if…

This note gives necessary and sufficient conditions for a sequence of non-negative integers to be the degree sequence of a connected simple graph. This result is implicit in a paper of Hakimi. A new alternative characterisation of these…

This paper formulates a necessary and sufficient condition for a generic graph matching problem to be equivalent to the maximum vertex and edge weight clique problem in a derived association graph. The consequences of this results are…

Let K be a fine hyperbolic graph and G be a group acting on K with finite quotient. We prove that G is exact provided that all vertex stabilizers are exact. In particular, a relatively hyperbolic group is exact if all its peripheral groups…

We establish certain uniform a priori bounds for hyperbolic components of disjoint type. As an application, we will prove that Sierpinski carpet hyperbolic components of disjoint type are bounded. Furthermore, we show that for each map $f$…

In this paper we study the relationship of hyperbolicity and (Cheeger) isoperimetric inequality in the context of Riemannian manifolds and graphs. We characterize the hyperbolic manifolds and graphs (with bounded local geometry) verifying…

Let $F$ be a compact orientable surface with nonempty boundary other than a disk. Let $L$ be a link in $F \times I$ with a connected weakly prime cellular alternating projection to $F$. We provide simple conditions that determine exactly…

Let $V$ be a finite graph and let $\phi:V\rightarrow V$ be an irreducible train track map whose mapping torus has word-hyperbolic fundamental group $G$. Then $G$ acts freely and cocompactly on a CAT(0) cube complex.

We give a new proof of the fact that the complement of the complexification of a real hyperplane arrangement is homotopy equivalent to the Salvetti complex of the associated oriented matroid. Our proof involves no choices, is relatively…

We characterize hyperfinite bipartite graphings that admit measurable perfect matchings. In particular, we prove that every regular hyperfinite bipartite graphing admits a measurable perfect matching if it is one-ended or the degree is odd.…

Two vertices are said to be finitely connected if they belong to the same cluster and this cluster is finite. We derive sharp asymptotics for finite connection probabilities for supercritical Bernoulli bond percolation on Z^2.

We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…

Answering a question due to Min, we prove that a finite graph of roses admits a regluing such that the resulting graph of roses has hyperbolic fundamental group.

A large variety of interacting complex systems are characterized by interactions occurring between more than two nodes. These systems are described by simplicial complexes. Simplicial complexes are formed by simplices (nodes, links,…

In this paper we establish some spectral conditions for a graph to be Hamilton-connected in terms of the spectral radius of the adjacency matrix or the signless Laplacian of the graph or its complement. For the existence of Hamiltonian…

We identify a condition that prevents a hyperbolic space from being quasi-isometric to the curve complex of any non-sporadic surface. Our result applies to several hyperbolic complexes, including arc complexes, disk complexes,…

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…

For a hierarchically hyperbolic group, we provide sufficient conditions under which suitable powers of a finite collection of elements generate a right-angled Artin subgroup. Under additional hypotheses, we further show that this subgroup…

We systematically investigate three different equivalence relations of connectedness: being connected by arcs, being connected by continua and being connected by chains of continua of decreasing diameter. The investigation is conducted from…

We prove that a wide range of coloring problems in graphs on surfaces can be resolved by inspecting a finite number of configurations.