Related papers: A threshold for relative hyperbolicity in random r…

We give lower bounds on the maximum possible girth of an $r$-uniform, $d$-regular hypergraph with at most $n$ vertices, using the definition of a hypergraph cycle due to Berge. These differ from the trivial upper bound by an absolute…

We find conditions for the connectivity of inhomogeneous random graphs with intermediate density. Our results generalize the classical result for G(n, p), when p = c log n/n. We draw n independent points X_i from a general distribution on a…

We explore the combination theorem for a group G splitting as a graph of relatively hyperbolic groups. Using the fine graph approach to relative hyperbolicity, we find short proofs of the relative hyperbolicity of G under certain…

In the density model of random groups, we consider presentations with any fixed number m of generators and many random relators of length l, sending l to infinity. If d is a "density" parameter measuring the rate of exponential growth of…

We study boundaries arising from limits of ratios of transition probabilities for random walks on relatively hyperbolic groups. We extend, as well as determine significant limitations of, a strategy employed by Woess for computing…

Given a finite graph of relatively hyperbolic groups with its fundamental group relatively hyperbolic and edge groups quasi-isometrically embedded and relatively quasiconvex in vertex groups, we prove that vertex groups are relatively…

For $k\mid n$ let $Comb_{n,k}$ denote the tree consisting of an $(n/k)$-vertex path with disjoint $k$-vertex paths beginning at each of its vertices. An old conjecture says that for any $k=k(n)$ the threshold for the random graph $G(n,p)$…

If $A_\Gamma$ ($W_\Gamma$) is the Artin (Coxeter) group with defining graph $\Gamma$ we denote by $Sim(\Gamma)$ the number of vertices of the largest clique in $\Gamma$. We show that $asdimA_\Gamma \leq Sim(\Gamma)$, if $Sim(\Gamma)=2$. We…

We study relatively hyperbolic Coxeter groups of type $HM$ with maximal Euclidean Coxeter subgroups of codimension 1. Our main result in this paper is that the dimension of these groups is bounded above.

We establish three criteria of hyperbolicity of a graph in terms of ``average width of geodesic bigons''. In particular we prove that if the ratio of the Van Kampen area of a geodesic bigon $\beta$ and the length of $\beta$ in the Cayley…

We prove that random d-regular Cayley graphs of the symmetric group asymptotically almost surely have girth at least (log_{d-1}|G|)^{1/2}/2 and that random d-regular Cayley graphs of simple algebraic groups over F_q asymptotically almost…

We study classes of right-angled Coxeter groups with respect to the strong submodel relation of parabolic subgroup. We show that the class of all right-angled Coxeter group is not smooth, and establish some general combinatorial criteria…

In this paper, we show that the boundary $\partial\Sigma(W,S)$ of a right-angled Coxeter system $(W,S)$ is minimal if and only if $W_{\tilde{S}}$ is irreducible, where $W_{\tilde{S}}$ is the minimum parabolic subgroup of finite index in…

The unit ball random geometric graph $G=G^d_p(\lambda,n)$ has as its vertices $n$ points distributed independently and uniformly in the $d$-dimensional unit ball, with two vertices adjacent if and only if their $l_p$-distance is at most…

We determine the sharp threshold for Hamilton cycles in randomly perturbed sparse graphs. For any $\alpha=\alpha(n)=o(1)$, let $G_{\alpha}$ be an $n$-vertex graph with minimum degree $\delta(G_{\alpha})\ge\alpha n$. We prove that if…

In this paper, we consider a deterministic graph~\(\Gamma\) drawn on the unit square with straight line segments as edges and connect vertices of~\(\Gamma\) using edges of a random geometric graph (RGG)~\(G\) with adjacency distance~\(r_n\)…

A random algebraic graph is defined by a group $G$ with a uniform distribution over it and a connection $\sigma:G\longrightarrow[0,1]$ with expectation $p,$ satisfying $\sigma(g)=\sigma(g^{-1}).$ The random graph…

Motivated by the Beck-Fiala conjecture, we study the discrepancy problem in two related models of random hypergraphs on $n$ vertices and $m$ edges. In the first (edge-independent) model, a random hypergraph $H_1$ is constructed by fixing a…

We establish the conditions under which several algorithmically exploitable structural features hold for random intersection graphs, a natural model for many real-world networks where edges correspond to shared attributes. Specifically, we…

We introduce a new quasi-isometry invariant, called the divergence spectrum, to study finitely generated groups. We compare the concept of divergence spectrum with the other classical notions of divergence and we examine the divergence…