Related papers: A finitary structure theorem for vertex-transitive…

A direct consequence of Gromov's theorem is that if a group has polynomial geodesic growth with respect to some finite generating set then it is virtually nilpotent. However, until now the only examples known were virtually abelian. In this…

A Cayley graph $\Ga=\Cay(G,S)$ is said to be normal if $G$ is normal in $\Aut\Ga$. The concept of normal Cayley graphs was first proposed by M.Y.Xu in [Discrete Math. 182, 309-319, 1998] and it plays an important role in determining the…

For a nilpotent group $G$, let $\Xi(G)$ be the difference between the complement of the generating graph of $G$ and the commuting graph of $G$, with vertices corresponding to central elements of $G$ removed. That is, $\Xi(G)$ has vertex set…

A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…

Given a bounded valence, bushy tree T, we prove that any cobounded quasi-action of a group G on T is quasiconjugate to an action of G on another bounded valence, bushy tree T'. This theorem has many applications: quasi-isometric rigidity…

We prove that any non-amenable Cayley graph admits a factor of IID perfect matching. We also show that any connected d-regular vertex tran- sitive graph admits a perfect matching. The two results together imply that every Cayley graph…

We prove that a simple random walk on quasi-transitive graphs with the volume growth being faster than any polynomial of degree 4 has a.s. infinitely many cut times, and hence infinitely many cutpoints. This confirms a conjecture raised by…

In the present paper, we develop geometric analytic techniques on Cayley graphs of finitely generated abelian groups to study the polynomial growth harmonic functions. We develop a geometric analytic proof of the classical Heilbronn theorem…

Half-arc-transitive graphs are a fascinating topic which connects graph theory, Riemann surfaces and group theory. Although fruitful results have been obtained over the last half a century, it is still challenging to construct…

We study properties of automorphisms of graph products of groups. We show that graph product $\Gamma\mathcal{G}$ has non-trivial pointwise inner automorphisms if and only if some vertex group corresponding to a central vertex has…

A weighted graph $G$ with countable vertex set is bounded if there is an upper bound on the maximum of the sum of absolute values of all edge weights incident to a vertex in $G$. In this paper, we prove a fundamental result on equitable…

We define the notion of rough Cayley graph for compactly generated locally compact groups in terms of quasi-actions. We construct such a graph for any compactly generated locally compact group using quasi-lattices and show uniqueness up to…

A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. The authors recently proved a conjecture of McDiarmid, Steger, and…

We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.

The main result of this paper is that, if $\Gamma$ is a connected 4-valent $G$-arc-transitive graph and $v$ is a vertex of $\Gamma$, then either $\Gamma$ is one of a well understood infinite family of graphs, or $|G_v|\leq 2^43^6$ or…

We consider the graph $\Gamma_{\rm{virt}}(G)$ whose vertices are the elements of a finitely generated profinite group $G$ and where two vertices $x$ and $y$ are adjacent if and only if they topologically generate an open subgroup of $G$. We…

Gromov's theorem states that a finitely generated group has polynomial growth if and only if it is virtually nilpotent. A key ingredient in its proof is the small doubling property. In this work, we study entropy analogues of this property…

We prove an Antal-Pisztora type theorem for transitive graphs of polynomial growth. That is, we show that if $G$ is a transitive graph of polynomial growth and $p > p_c(G)$, then for any two sites $x, y$ of $G$ which are connected by a…

In vertex-cut sparsification, given a graph $G=(V,E)$ with a terminal set $T\subseteq V$, we wish to construct a graph $G'=(V',E')$ with $T\subseteq V'$, such that for every two sets of terminals $A,B\subseteq T$, the size of a minimum…

This note presents a new, elementary proof of a generalization of a theorem of Halin to graphs with unbounded degrees, which is then applied to show that every connected, countably infinite graph G with a subdegree-finite, infinite…