Related papers: Matching arc complexes: connectedness and hyperbol…
By constructing, in the relative case, objects analoguous to Rips and Sela's canonical representatives, we prove that the set of images by morphisms without accidental parabolic, of a finitely presented group in a relatively hyperbolic…
We define an algebraic setup of homology for hypergraphs, which defaults to simplicial homology in the case of graphs, and study its basic properties. As part of our study we define algebraic spanning trees of hypergraphs, along with…
We prove that the separating curve graph of a connected, compact, orientable surface with genus at least 3 and a single boundary component is not relatively hyperbolic. This completes the classification of when the separating curve graph is…
We construct examples of free-by-cyclic hyperbolic groups which fiber in infinitely many ways over Z. The construction involves adding a specialized square 2-cell to a non-positively curved, squared 2-complex defined by labeled oriented…
We give a combinatorial proof, using the hyperbolicity of the curve graphs, of the bounded geodesic image theorem of Masur and Minsky. Recently it has been shown that curve graphs are uniformly hyperbolic, thus a universal bound can be…
We consider principal fibre bundles with a given connection and construct almost complex structures on the total space if the adjoint bundle is isomorphic to the tangent bundle of the base. We derive the integrability condition. If the…
For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…
A perfect matching in a hypergraph is a set of edges that partition the set of vertices. We study the complexity of deciding the existence of a perfect matching in orderable and separable hypergraphs. We show that the class of orderable…
In this paper we consider families of holomorphic maps defined on subsets of the complex plane, and show that the technique developed in \cite{LSvS1} to treat unfolding of critical relations can also be used to deal with cases where the…
A matching complex of a simple graph $G$ is a simplicial complex with faces given by the matchings of $G$. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa…
This paper is about hyperbolic properties on planar graphs. First, we study the relations among various kinds of strong isoperimetric inequalities on planar graphs and their duals. In particular, we show that a planar graph satisfies a…
Singular and sectional hyperbolic sets are the objects of the extension of the classical Smale Hyperbolic Theory to flows having invariant sets with singularities accumulated by regular orbits within the set. It is by now well-known that…
Extending the notion of (random) $k$-out graphs, we consider when the $k$-out hypergraph is likely to have a perfect fractional matching. In particular, we show that for each $r$ there is a $k=k(r)$ such that the $k$-out $r$-uniform…
In this paper, we shall consider the notion of hyperbolic semi norm which on a module $X$ to set of all positive hyperbolic numbers. We shall prove the characterization of continuity of hyperbolic semi norm in this setup. We shall prove…
It follows from known results that every regular tripartite hypergraph of positive degree, with $n$ vertices in each class, has matching number at least $n/2$. This bound is best possible, and the extremal configuration is unique. Here we…
This is an announcement of some of the results obtained as a part of the second author's Ph.D. thesis. In the first part, we prove that the fundamental group of an acylindrical complex of hyperbolic groups with finite edge groups is…
This paper investigates sufficient and necessary conditions for the existence of a homotopy equivalence between two finite simplicial complexes from an algorithmic point of view. As a result, the conditions are formulated in terms of the…
We prove a combination theorem for trees of (strongly) relatively hyperbolic spaces and finite graphs of (strongly) relatively hyperbolic groups. This gives a geometric extension of Bestvina and Feighn's Combination Theorem for hyperbolic…
We introduce the concept of matching connectivity as a notion of connectivity in graph admitting perfect matchings which heavily relies on the structural properties of those matchings. We generalise a result of Robertson, Seymour and Thomas…
This note describes necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a connected simple graph. Conditions are also given under which a sequence is necessarily connected i.e. the sequence…