Self-embeddings of trees

DOI10.1016/J.DISC.2019.06.040MaRDI QIDQ2329170zbMATH OpenOpenAlexFDO

Authors Matthias Hamann

Publication date 17 October 2019

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1709.05891

zbMATH Keywords

infinite treesself-embeddings

Mathematics Subject Classification ID

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Infinite graphs (05C63)

Abstract: We prove a fix point theorem for monoids of self-embeddings of trees. As a corollary, we obtain a result by Laflamme, Pouzet and Sauer that a tree either contains a subdivided binary tree as a subtree or has a vertex, and edge, an end or two ends fixed by all its self-embeddings.

Recommendations

• Tree self-embeddings
• Self-embeddings of computable trees
• Fixed elements of infinite trees
• Free subgroups in the automorphism groups of trees.
• Mutually embeddable graphs and the tree alternative conjecture

Cites work

• Amenable group actions on infinite graphs
• Automorphisms and endomorphisms of infinite locally finite graphs
• Bilateral denseness of the hyperbolic limit points of groups acting on metric spaces
• Ends of graphs
• Fixed sets and free subgroups of groups acting on metric spaces
• Group actions on metric spaces: fixed points and free subgroups
• Invariant subsets of scattered trees and the tree alternative property of Bonato and Tardif
• Locally finite graphs with ends: A topological approach. I: Basic theory
• Locally finite graphs with ends: A topological approach. II: Applications
• Mutually embeddable graphs and the tree alternative conjecture
• On finite fixed sets in infinite graphs

Cited in

(10)

• Self-embeddings of computable trees
• Invariant subsets of scattered trees and the tree alternative property of Bonato and Tardif
• Embedding trees in recursive circulants
• Embeddings and other mappings of rooted trees into complete trees
• On Ramsey-minimal infinite graphs
• Tree self-embeddings
• Perfect trees and elementary embeddings
• A Cantor-Bendixson rank for siblings of trees
• An example of Tateno disproving conjectures of Bonato-Tardif, Thomasse, and Tyomkyn
• Mutually embeddable graphs and the tree alternative conjecture

This page was built for publication: Self-embeddings of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329170)