Every rayless graph has an unfriendly partition
Combinatorics
2009-12-21 v3
Abstract
We prove that every rayless graph has an unfriendly partition.
Cite
@article{arxiv.0901.4858,
title = {Every rayless graph has an unfriendly partition},
author = {Henning Bruhn and Reinhard Diestel and Agelos Georgakopoulos and Philipp Sprüssel},
journal= {arXiv preprint arXiv:0901.4858},
year = {2009}
}
Comments
Final, slightly modified, version. To appear in combinatorica