Twins of rayless graphs
Combinatorics
2009-11-20 v1
Abstract
Two non-isomorphic graphs are twins if each is isomorphic to a subgraph of the other. We prove that a rayless graph has either infinitely many twins or none.
Keywords
Cite
@article{arxiv.0911.3803,
title = {Twins of rayless graphs},
author = {A. Bonato and H. Bruhn and R. Diestel and P. Sprüssel},
journal= {arXiv preprint arXiv:0911.3803},
year = {2009}
}
Comments
8 pages