Every rayless graph has an unfriendly partition

arxiv: 0901.4858 · v3 · submitted 2009-01-30 · 🧮 math.CO

Henning Bruhn , Reinhard Diestel , Agelos Georgakopoulos , Philipp Spr\"ussel This is my paper

classification 🧮 math.CO

keywords everygraphpartitionraylessunfriendlyprove

0 comments

read the original abstract

We prove that every rayless graph has an unfriendly partition.

This paper has not been read by Pith yet.