Related papers: Minor exclusion in quasi-transitive graphs
A measure-scaling quasi-isometry between two connected graphs is a quasi-isometry that is quasi-$\kappa$-to-one in a natural sense for some $\kappa>0$. For non-amenable graphs, all quasi-isometries are quasi-$\kappa$-to-one for any…
We study the first uniformly finite homology group of Block and Weinberger for uniformly locally finite graphs, with coefficients in $\mathbb{Z}$ and $\mathbb{Z}_2$. When the graph is a tree, or coefficients are in $\mathbb{Z}_2$, a…
A connected graph, on four or more vertices, is matching covered (aka 1-extendable) if every edge is present in some perfect matching. An ear decomposition theorem exists for bipartite matching covered graphs due to Hetyei. From the results…
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…
We prove that there is a function $f$ such that every graph with no $K$-fat $K_4$ minor is $f(K)$-quasi-isometric to a graph with no $K_4$ minor. This solves the $K_4$-case of a general conjecture of Georgakopoulos and Papasoglu. Our proof…
We show that a smaller version of the Kontsevich graph complex spanned by triconnected graphs is quasi-isomorphic to the full Kontsevich graph complex.
Closed subgroups of the group of isometries of the regular tree $\treeq$ that fix an end of the tree and are vertex-transitive are shown to correspond, on one hand, to self-replicating groups acting on rooted trees and, on the other hand,…
Loebl, Komlos, and Sos conjectured that if at least half of the vertices of a graph G have degree at least some natural number k, then every tree with at most k edges is a subgraph of G. Our main result is an approximate version of this…
We study permanence results for almost quasi-isometries, the maps arising from the Gromov construction of finitely generated random groups that contain expanders (and hence that are not C*-exact). We show that the image of a sequence of…
An inaccessible, vertex transitive, locally finite graph is described. This graph is not quasi-isometric to a Cayley graph.
In an early work from 1896, Maschke established the complete list of all finite planar Cayley graphs. This result initiated a long line of research over the next century, aiming at characterizing in a similar way all planar infinite Cayley…
We look at tree amalgamations of locally finite quasi-transitive hyperbolic graphs and prove that the homeomorphism type of the hyperbolic boundary of such a tree amalgamation only depends on the homeomorphism types of the hyperbolic…
A self-contained account of the theory of structure trees for edge cuts in networks is given. Applications include a generalisation of the Max-Flow Min-Cut Theorem to infinite networks and a short proof of a conjecture of Kropholler. This…
This paper investigates quasi-isometries between graphs with variable edge lengths. A quasi-isometry is a mapping between metric spaces that approximately preserves distances, allowing for a bounded amount of additive and multiplicative…
The well-known characterization of two-ended groups says that every two-ended group can be split over finite subgroups which means it is isomorphic to either by a free product with amalgamation $A\ast_C B$ or an HNN-extension $\ast_{\phi}…
When does a graph admit a tree-decomposition in which every bag has small diameter? For finite graphs, this is a property of interest in algorithmic graph theory, where it is called having bounded ``tree-length''. We will show that this is…
We classify the groups quasi-isometric to a group generated by finite-order elements within the class of one-ended hyperbolic groups which are not Fuchsian and whose JSJ decomposition over two-ended subgroups does not contain rigid vertex…
A strongly regular graph is called trivial if it or its complement is a union of disjoint cliques. We prove that every infinite family of nontrivial strongly regular graphs is quasi-random in the sense of Chung, Graham and Wilson.
We show that recent results of U. Baumgartner and G.A. Willis concerning contraction groups of automorphisms of metrizable, totally disconnected, locally compact groups remain valid also in the non-metrizable case, if one restricts…
A forest is the clique complex of a strongly chordal graph and a quasi-forest is the clique complex of a chordal graph. Kruskal--Katona type theorems for forests, quasi-forests, pure forests and pure quasi-forests will be presented. In…