Related papers: Palindromic widths of graph of groups
This paper is devoted to the investigation of the property of order separability for HNN extensions and free products with commutative subgroups. Particularly it was proven that HNN extension of a free group with maximal connected cyclic…
We find an upper bound for the asymptotic dimension of a hyperbolic metric space with a set of geodesics satisfying a certain boundedness condition studied by Bowditch. The primary example is a collection of tight geodesics on the curve…
The thinness of a graph is a width parameter that generalizes some properties of interval graphs, which are exactly the graphs of thinness one. Many NP-complete problems can be solved in polynomial time for graphs with bounded thinness,…
An infinite structure has the finite length property (over a given field) if, for each of its finite powers, chains of equivariant subspaces in the corresponding free vector space are bounded in length. Prior work showed that the countable…
Let $p$ be a fixed prime. For a finite group generated by elements of order $p$, the $p$-width is defined to be the minimal $k\in\mathbb{N}$ such that any group element can be written as a product of at most $k$ elements of order $p$. Let…
We study analytic properties of graph product of finite groups with a hyperbolic defining graph. This is done by studying dynamics on the Bowditch compactification of the extension graph, or the crossing graph, of graph product. In…
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.
It was recently proved that every planar graph is a subgraph of the strong product of a path and a graph with bounded treewidth. This paper surveys generalisations of this result for graphs on surfaces, minor-closed classes, various…
We use tools from free probability to study the spectra of Hermitian operators on infinite graphs. Special attention is devoted to universal covering trees of finite graphs. For operators on these graphs we derive a new variational formula…
In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…
Witte Morris showed in [21] that every connected Cayley graph of a finite (generalized) dihedral group has a Hamiltonian path. The infinite dihedral group is defined as the free product with amalgamation $\mathbb Z_2 \ast \mathbb Z_2$. We…
We establish conditions under which the fundamental group of a graph of finite $p$-groups is necessarily residually $p$-finite. The technique of proof is independent of previously established results of this type, and the result is also…
Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.
It is shown that there exist finitely generated infinite simple groups of infinite commutator width and infinite square width on which there exists no stably unbounded conjugation-invariant norm, and in particular stable commutator length…
We consider the flip-width of geometric graphs, a notion of graph width recently introduced by Toru\'nczyk. We prove that many different types of geometric graphs have unbounded flip-width. These include interval graphs, permutation graphs,…
The diameter of the spectral pseudometric on the universal cover of the Hamiltonian diffeomorphism group of $\mathrm{Gr}(2,p)$ is shown to be finite whenever $p$ is a prime number. On the other hand, it is shown that the diameter is…
We consider hereditary classes of graphs equipped with a total order. We provide multiple equivalent characterisations of those classes which have bounded twin-width. In particular, we prove a grid theorem for classes of ordered graphs…
The GG-width of a class of graphs GG is defined as follows. A graph G has GG-width k if there are k independent sets N1,...,Nk in G such that G can be embedded into a graph H in GG such that for every edge e in H which is not an edge in G,…
The palindromic length of a finite word $w$ is defined as the minimal number of palindromes such that their product is $w$. Clearly, this function may take different values depending on if we consider $w$ as an element a free semigroup or…
We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an expanding subgraph of G. Our results imply that if one of these…