Related papers: On the hyperbolicity constant of circular-arc grap…
We give tight upper and lower bounds of the cardinality of the index sets of certain hyperbolic crosses which reflect mixed Sobolev-Korobov-type smoothness and mixed Sobolev-analytic-type smoothness in the infinite-dimensional case where…
We introduce a notion of the \emph{crux} of a graph $G$, measuring the order of a smallest dense subgraph in $G$. This simple-looking notion leads to some generalisations of known results about cycles, offering an interesting paradigm of…
Hoffman's bound is a well-known eigenvalue bound on the chromatic number of a graph. By interpreting this bound as a parameter, we show multiple applications of colorings attaining the bound (Hoffman colorings) for several notions of graph…
We study typical distances in a geometric random graph on the hyperbolic plane. Introduced by Krioukov et al.~\cite{ar:Krioukov} as a model for complex networks, $N$ vertices are drawn randomly within a bounded subset of the hyperbolic…
In this paper we study the global geometry of the Kobayashi metric on domains in complex Euclidean space. We are particularly interested in developing necessary and sufficient conditions for the Kobayashi metric to be Gromov hyperbolic. For…
In this paper, we present some new results describing connections between the spectrum of a regular graph and its generalized connectivity, toughness, and the existence of spanning trees with bounded degree.
We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…
This paper investigates a generalized hyperbolic circle packing (including circles, horocycles or hypercycles) with respect to the total geodesic curvatures on the surface with boundary. We mainly focus on the existence and rigidity of…
We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…
The pants graph has proved to be influential in understanding 3-manifolds concretely. This stems from a quasi-isometry between the pants graph and the Teichm\"uller space with the Weil-Petersson metric. Currently, all estimates on the…
Based on earlier work by Carlen-Maas and the second- and third-named author, we introduce the notion of intertwining curvature lower bounds for graphs and quantum Markov semigroups. This curvature notion is stronger than both Bakry-\'Emery…
Intersection graphs are very important in both theoretical as well as application point of view. Depending on the geometrical representation, different type of intersection graphs are defined. Among them interval, circular-arc, permutation,…
In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main…
This paper establishes sharp bounds for the vulnerability measures of closeness and generalized closeness in graphs and identifies graphs that attain these bounds. It further develops bounds incorporating Zagreb indices for triangle- and…
This paper is a survey of some of the developments in coarse extrinsic geometry since its inception in the work of Gromov. Distortion, as measured by comparing the diameter of balls relative to different metrics, can be regarded as one of…
We obtain sharp bounds for the number of n-cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. En route, we prove some sharp estimates on power…
Affine geometry is usually regarded as a framework in which metric notions such as distance and angle are absent. However, just as projective geometry produces various metric geometries by introducing additional structures on the line at…
To reinforce the analogy between the mapping class group and the Cremona group of rank $2$ over an algebraic closed field, we look for a graph analoguous to the curve graph and such that the Cremona group acts on it non-trivially. A…
Any infinite graph has site and bond percolation critical probabilities satisfying $p_c^{site}\geq p_c^{bond}$. The strict version of this inequality holds for many, but not all, infinite graphs. In this paper, the class of graphs for which…
We give several algebraic bounds for percolation on directed and undirected graphs: proliferation of strongly-connected clusters, proliferation of in- and out-clusters, and the transition associated with the number of giant components.