Every rayless graph has an unfriendly partition

2009/01/30 by Henning Bruhn, Reinhard Diestel, Bruhn, Henning +5 · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications

paper · pdf · doi:10.48550/arxiv.0901.4858

openalex publication_date 2009/01/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We prove that every rayless graph has an unfriendly partition.

Cited by

• On better-quasi-ordering under graph minors
• The strong Nash-Williams orientation theorem for rayless graphs

Related

• Unfriendly partitions when avoiding vertices of finite degree
• Unfriendly or weakly unfriendly partitions of graphs
• Remarks on the countable case of the Unfriendly Partition Problem
• All graphs are majority 3-choosable
• Twins of rayless graphs