Every rayless graph has an unfriendly partition

Abstract

We prove that every rayless graph has an unfriendly partition.

Final, slightly modified, version. To appear in combinatorica