Related papers: Unimodular random graphs with Property (T) have co…

Almost forty years ago, Connes, Feldman and Weiss proved that for measurable equivalence relations the notions of amenability and hyperfiniteness coincide. In this paper we define the uniform version of amenability and hyperfiniteness for…

Unigraphs are graphs identifiable up to isomorphism from their degree sequences. Given a class $\mathcal{A}$ of graphs, we define the class of $\mathcal{A}$-unigraphs to be graphs identifiable from degree sequence and membership in…

We prove that the cut space of any transitive graph $G$ is a finitely generated ${\rm Aut}(G)$-module if the same is true for its cycle space. This confirms a conjecture of Diestel which says that every locally finite transitive graph whose…

Consider an infinite planar graph with uniform polynomial growth of degree d > 2. Many examples of such graphs exhibit similar geometric and spectral properties, and it has been conjectured that this is necessary. We present a family of…

We study actions of countable discrete groups which are amenable in the sense that there exists a mean on X which is invariant under the action of G. Assuming that G is nonamenable, we obtain structural results for the stabilizer subgroups…

We consider the boundary-path groupoids of topological higher-rank graphs. We show that the all such groupoids are topologically amenable. We deduce that the C*-algebras of topological higher-rank graphs are nuclear and prove versions of…

Gomory and Hu proved that if $ G $ is a finite graph with non-negative weights on its edges, then there exists a tree $ T $ (called now Gomory-Hu tree) on $ V(G) $ such that for all $ u\neq v\in V(G) $ there is an $ e\in E(T) $ such that…

J.H.C. Whitehead's second free-group algorithm determines whether or not two given elements of a free group lie in the same orbit of the automorphism group of the free group. The algorithm involves certain connected graphs, and Whitehead…

This article is concerned with measure equivalence and uniform measure equivalence of locally compact, second countable groups. We show that two unimodular, locally compact, second countable groups are measure equivalent if and only if they…

We establish a new characterization of property (T) in terms of the Furstenberg entropy of nonsingular actions. Given any generating measure $\mu$ on a countable group $G$, A. Nevo showed that a necessary condition for $G$ to have property…

Over all graphs (or unicyclic graphs) of a given order, we characterise those graphs that minimise or maximise the number of connected induced subgraphs. For each of these classes, we find that the graphs that minimise the number of…

Let $G$ be a graph in which each vertex initially has weight 1. In each step, the weight from a vertex $u$ can be moved to a neighbouring vertex $v$, provided that the weight on $v$ is at least as large as the weight on $u$. The total…

We extend a result of Lyons (2016) from fractional tiling of finite graphs to a version for infinite random graphs. The most general result is as follows. Let $\bf P$ be a unimodular probability measure on rooted networks $(G, o)$ with…

Let A be a regular domain of dimension d containing an infinite field and let n be an integer with 2n\geq d+3. For a stably free A-module P of rank n, we prove that (i) P has a unimodular element if and only if the euler class of P is zero…

For a finite group $G$, the vertices of the prime graph $\Gamma(G)$ are the primes that divide $|G|$, and two vertices $p$ and $q$ are connected by an edge if and only if there is an element of order $pq$ in $G$. Prime graphs of solvable…

We establish universality of cutoff for simple random walk on a class of random graphs defined as follows. Given a finite graph $G=(V,E)$ with $|V|$ even we define a random graph $ G^*=(V,E \cup E')$ obtained by picking $E'$ to be the…

We prove that if $G$ is a countable, discrete group having infinite, normal subgroups with the relative property (T), then the Bernoulli shift action of $G$ on ${\underset g \in G \to \Pi} (X_0, \mu_0)_g$ for $(X_{0},\mu_{0})$ an arbitrary…

In 1992, David Wright proved a remarkable theorem about which contractible open manifolds are covering spaces. He showed that if a one-ended open manifold M has pro-monomorphic fundamental group at infinity which is not pro-trivial and is…

Given a simple graph $G$ on $n$ vertices, a subset of vertices $U \subseteq V(G)$ is dominating if every vertex of $V(G)$ is either in $U$ or adjacent to a vertex of $U$. The domination polynomial of $G$ is the generating function whose…

We prove the Haagerup property (= Gromov's a-T-menability) for finitely generated groups defined by infinite presentations satisfying the C'(1/6)-small cancellation condition. We deduce that these groups are coarsely embeddable into a…