Related papers: Maximally symmetric trees
An independent edge set of graph $G$ is a matching, and is maximal if it is not a proper subset of any other matching of $G$. The number of all the maximal matchings of $G$ is denoted by $\Psi(G)$. In this paper, an algorithm to count…
We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.
We introduce the notion of mixed subtree quasi-isometries, which are self quasi-isometries of regular trees built in a specific inductive way. We then show that any self quasi-isometry of a regular tree is at bounded distance from a…
We consider classes of graphs, which we call thick graphs, that have the vertices of a corresponding thin graph replaced by cliques and the edges replaced by cobipartite graphs In particular, we consider the case of thick forests, which we…
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
Let Gamma be a connected, locally finite graph of finite tree width and G be a group acting on it with finitely many orbits and finite node stabilizers. We provide an elementary and direct construction of a tree T on which G acts with…
Totally symmetric sets are a recently introduced tool for studying homomorphisms between groups. In this paper, we give full classifications of totally symmetric sets in certain families of groups and bound their sizes in others. As a…
We survey the theory of totally symmetric sets, with applications to homomorphisms of symmetric groups, braid groups, linear groups, and mapping class groups.
We define and give explicit construction of the universal tree-graded space with a given collection of pieces. We apply that to proving uniqueness of asymptotic cones of relatively hyperbolic groups whose peripheral subgroups have unique…
Finding the number of maximal subgroups of infinite index of a finitely generated group is a natural problem that has been solved for several classes of `geometric' groups (linear groups, hyperbolic groups, mapping class groups, etc). Here…
We show the theory of pointed $\R$-trees with radius at most $r$ is axiomatizable in a suitable continuous signature. We identify the model companion $\rbRT_r$ of this theory and study its properties. In particular, the model companion is…
Commability is the finest equivalence relation between locally compact groups such that $G$ and $H$ are equivalent whenever there is a continuous proper homomorphism $G \to H$ with cocompact image. Answering a question of Cornulier, we show…
We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a complexity of natural number $n$ is…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…
We construct a boundary of a finite rank free group relative to a finite list of conjugacy classes of maximal cyclic subgroups. From the cut points and uncrossed cut pairs of this boundary we construct a simplicial tree on which the group…
We determine all the multiplicity-free representations of the symmetric group. This project is motivated by a combinatorial problem involving systems of set-partitions with a specific pattern of intersection.
We obtain a homological characterisation of virtually free-by-cyclic groups among groups that are hyperbolic and virtually compact special. As a consequence, we show that many groups known to be coherent actually possess the stronger…
Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…
A quasiconformal tree $T$ is a (compact) metric tree that is doubling and of bounded turning. We call $T$ trivalent if every branch point of $T$ has exactly three branches. If the set of branch points is uniformly relatively separated and…
To any free group automorphism, we associate a real pretree with several nice properties. First, it has a rigid/non-nesting action of the free group with trivial arc stabilizers. Secondly, there is an expanding pretree-automorphism of the…