Self-embeddings of trees
Combinatorics
2017-09-19 v1
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.
Keywords
Cite
@article{arxiv.1709.05891,
title = {Self-embeddings of trees},
author = {Matthias Hamann},
journal= {arXiv preprint arXiv:1709.05891},
year = {2017}
}
Comments
10 pages