Related papers: On the hyperbolicity constant of circular-arc grap…
A graph homomorphism between two graphs is a map from the vertex set of one graph to the vertex set of the other graph, that maps edges to edges. In this note we study the range of a uniformly chosen homomorphism from a graph G to the…
The complexity of a graph is the number of its labeled spanning trees. In this work complexity is studied in settings that admit regular graphs. An exact formula is established linking complexity of the complement of a regular graph to…
Gromov hyperbolic spaces have become an essential concept in geometry, topology and group theory. Here we extend Ancona's potential theory on Gromov hyperbolic manifolds and graphs of bounded geometry to a large class of Schr\"odinger…
We prove that Bernoulli bond percolation on any nonamenable, Gromov hyperbolic, quasi-transitive graph has a phase in which there are infinitely many infinite clusters, verifying a well-known conjecture of Benjamini and Schramm (1996) under…
The essential graph is a distinguished member of a Markov equivalence class of AMP chain graphs. However, the directed edges in the essential graph are not necessarily strong or invariant, i.e. they may not be shared by every member of the…
We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…
We establish a sharp edge-connectivity estimate for graphs with non-negative Bakry-\'Emery curvature. This leads to a geometric criterion for the existence of a perfect matching. Precisely, we show that any regular graph with non-negative…
We show that trees of manifolds, the topological spaces introduced by Jakobsche, appear as boundaries at infinity of various spaces and groups. In particular, they appear as Gromov boundaries of some hyperbolic groups, of arbitrary…
We prove diameter bounds for graphs having positive Ricci-curvature bound in Bakry-Emery sense. One result using only curvature and maximal vertex degree is sharp in case of hypercubes. The other result depends on an additional dimension…
A circle graph is an intersection graph of a set of chords of a circle. We describe the unavoidable induced subgraphs of circle graphs with large treewidth. This includes examples that are far from the `usual suspects'. Our results imply…
We establish a sharp geometric constant for the upper bound on the resonance counting function for surfaces with hyperbolic ends. An arbitrary metric is allowed within some compact core, and the ends may be of hyperbolic planar, funnel, or…
We discuss the most elementary properties of the hyperbolic trigonometry and show how they can be exploited to get a simple, albeit interesting, geometrical interpretation of the special relativity. It yields indeed a straightforword…
If X is a geodesic metric space and $x_1,x_2,x_3\in X$, a {\it geodesic triangle} $T=\{x_1,x_2,x_3\}$ is the union of the three geodesics $[x_1x_2]$, $[x_2x_3]$ and $[x_3x_1]$ in $X$. The space $X$ is $\delta$-\emph{hyperbolic} $($in the…
We give a proof of the Gromov compactness theorem using the language of stable curves (i.e. cusp-curve of Gromov, or stable maps of Kontsevich and Manin) in general setting: An almost complex structure on a target manifold is only…
We propose an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact result, valid non-asymptotically for all graph sizes, which…
We derive a new upper bound on the algebraic connectivity of a regular graph using the Higman-Sims technique. Together with a new result on the connectivity of the neighbourhood graph of strongly regular graphs, our result gives a…
We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…
In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular graph. By using…
A multiarc and curve graph is a simplicial graph whose vertices are arc and curve systems on a compact, connected, orientable surface S. We show that all connected, non-trivial multiarc and curve graphs preserved by the natural action of…
In this paper we investigate the Gromov hyperbolicity of the classical Kobayashi and Hilbert metrics, and the recently introduced minimal metric. Using the linear isoperimetric inequality characterization of Gromov hyperbolicity, we show if…