Related papers: On sofic approximations of Property (T) groups

The relative Cayley graph of a group $G$ with respect to its proper subgroup $H$, is a graph whose vertices are elements of $G$ and two vertices $h\in H$ and $g\in G$ are adjacent if $g=hc$ for some $c\in C$, where $C$ is an inversed-closed…

We investigate the relationship between one of the classical notions of boundaries for infinite graphs, \emph{graph ends}, and self-adjoint extensions of the minimal Kirchhoff Laplacian on a metric graph. We introduce the notion of…

We show that the automorphism group of a graph product of finite groups $Aut(G_\Gamma)$ has Kazhdan's property (T) if and only if $\Gamma$ is a complete graph.

A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups, the only geodetic Cayley graphs are odd cycles and…

We show that every non-trivial compact connected group and every non-trivial general or special linear group over an infinite field admits a generating set such that the associated Cayley graph has infinite diameter.

We show that doubling at some large scale in a Cayley graph implies uniform doubling at all subsequent scales. The proof is based on the structure theorem for approximate subgroups proved by Green, Tao and the first author. We also give a…

We prove a quantitative, finitary version of Trofimov's result that a connected, locally finite vertex-transitive graph G of polynomial growth admits a quotient with finite fibres on which the action of Aut(G) is virtually nilpotent with…

An \emph{$(n,k,t)$-graph} is a graph on $n$ vertices in which every set of $k$ vertices contains a clique on $t$ vertices. Tur\'an's Theorem, rephrased in terms of graph complements, states that the unique minimum $(n,k,2)$-graph is an…

We define a way of approximating actions on measure spaces using finite graphs; we then show that in quite general settings these graphs form a family of expanders if and only if the action is expanding in measure. This provides a somewhat…

We show that the cop number of the Cayley sum graph of a finite group $G$ with respect to a symmetric subset $S$ is at most twice its degree when the graph is connected, undirected. We also prove that a similar bound holds for the cop…

The group property FW stands in-between the celebrated Kazdhan's property (T) and Serre's property FA. Among many characterizations, it might be defined, for finitely generated groups, as having all Schreier graphs one-ended. It follows…

In this note we give a short proof that graphs having no linearly small F{\o}lner sets can be partitioned into a union of expanders. We use this fact to prove a partition result for graphs admitting linearly small maximal F{\o}lner sets and…

Building on recent work by Thomassen, we show that Nash-Williams' orientation theorem, that every finite $2k$-edge-connected multigraph has a $k$-arc-connected orientation, also holds for all infinite multigraphs.

We provide a characterization of when a coarse equivalence between coarse disjoint unions of expander graphs is close to a bijective coarse equivalence. We use this to show that if the uniform Roe algebras of coarse disjoint unions of…

We characterize the class of infinite connected graphs $ G $ for which there exists a $ T $-join for any choice of an infinite $ T \subseteq V(G) $. We also show that the following well-known fact remains true in the infinite case. If $ G $…

We characterise Geometric Property (T) by the existence of a certain projection in the maximal uniform Roe algebra $C_{u,\max}^*(X)$, extending the notion of Kazhdan projection for groups to the realm of metric spaces. We also describe this…

Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid. As our main tool, we prove for any infinite graph $G$ with vertex sets $A$…

We prove that there exist $k\in N$ and $0<\epsilon\in R$ such that every non-abelian finite simple group $G$, which is not a Suzuki group, has a set of $k$ generators for which the Cayley graph $\Cay(G; S)$ is an $\epsilon$-expander.

We characterize the finitely generated groups that admit a Cayley graph whose only automorphisms are the translations, confirming a conjecture by Watkins from 1976. The proof relies on random walk techniques. As a consequence, every…

In earlier work we introduced the graph bracket polynomial of graphs with marked vertices, motivated by the fact that the Kauffman bracket of a link diagram D is determined by a looped, marked version of the interlacement graph associated…