Related papers: The Free Uniform Spanning Forest is disconnected i…
Tree-graded spaces are a generalization of $\mathbb{R}$-trees and play an important role in describing the large-scale geometry of relatively hyperbolic groups. We consider a subclass of tree-graded spaces that we call "disjointly…
In 1966, Cummins introduced the "tree graph": the tree graph $\mathbf{T}(G)$ of a graph $G$ (possibly infinite) has all its spanning trees as vertices, and distinct such trees correspond to adjacent vertices if they differ in just one edge,…
Completely independent spanning trees in a graph $G$ are spanning trees of $G$ such that for any two distinct vertices of $G$, the paths between them in the spanning trees are pairwise edge-disjoint and internally vertex-disjoint. In this…
The K-theoretic Farrell-Jones isomorphism conjecture for a group ring $R[G]$ has been proved for several groups. The toolbox for proving the Farrell-Jones conjecture for a given group depends on some geometric properties of the group as it…
Let X be an algebraic variety covered by open charts isomorphic to the affine space and q: X' \to X be the universal torsor over X. We prove that the automorphism group of the quasiaffine variety X' acts on X' infinitely transitively. Also…
We establish that the bisimulation invariant fragment of MSO over finite transition systems is expressively equivalent over finite transition systems to modal mu-calculus, a question that had remained open for several decades. The proof…
A new very simple proof of the number of labeled rooted forest-graphs with a given number of vertices is given. As a partial case of this formula we have Cayley's formula.
Suppose that $X$ is an infinite, connected, locally finite, quasi-transitive graph with the property that every bi-infinite quasi-geodesic uniformly coarsely separates $X$ into exactly two deep pieces. We show that such an $X$ is…
We study finitely generated pairs of groups $H \leq G$ such that the Schreier graph of $H$ has at least two ends and is \emph{narrow}. Examples of narrow Schreier graphs include those that are quasi-isometric to finitely ended trees or have…
It is shown that a flat subgroup, $H$, of the totally disconnected, locally compact group $G$ decomposes into a finite number of subsemigroups on which the scale function is multiplicative. The image, $P$, of a multiplicative semigroup in…
This work addresses the existence of transitive extensions of certain infinite permutation groups which arise as the automorphism groups of model-theoretic structures which are generic in the Fra\"iss\'e sense. The study of transitive…
An $r$-uniform hypergraph $H$ consists of a set of vertices $V$ and a set of edges whose elements are $r$-subsets of $V$. We define a hypertree to be a connected hypergraph which contains no cycles. A hypertree spans a hypergraph $H$ if it…
We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…
We make progress toward a characterization of the graphs $H$ such that every connected $H$-free graph has a longest path transversal of size $1$. In particular, we show that the graphs $H$ on at most $4$ vertices satisfying this property…
We consider a number of examples of groups together with an infinite conjugation invariant generating set, including: the free group with the generating set of all separable elements; surface groups with the generating set of all…
Biggs gave an explicit construction, using finite colored trees, of finite permutation groups whose Cayley graphs have valence \(C\) and girth tending to infinity as the radius \(R\) of the tree tends to infinity. We show that when the…
This paper investigates the class of k-universal finite graphs, a local analog of the class of universal graphs, which arises naturally in the study of finite variable logics. The main results of the paper, which are due to Shelah,…
Let $\mathcal{F}$ be a family of $r$-uniform hypergraphs, and let $H$ be an $r$-uniform hypergraph. Then $H$ is called $\mathcal{F}$-free if it does not contain any member of $\mathcal{F}$ as a subhypergraph. The Tur\'{a}n number of…
The connective constant $\mu(G)$ of an infinite transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. The relationship between connective constants and amenability is explored in the…
We continue the study of token sliding reconfiguration graphs of independent sets initiated by the authors in an earlier paper (arXiv:2203.16861). Two of the topics in that paper were to study which graphs $G$ are token sliding graphs and…