Every rayless graph has an unfriendly partition

DOI10.1007/s00493-010-2590-3zbMath1231.05211OpenAlexW2000632793MaRDI QIDQ5894428

Henning Bruhn, Reinhard Diestel, Angelos Georgakopoulos, Philipp Sprüssel

Publication date: 19 December 2011

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-010-2590-3

zbMATH Keywords

rayless graphunfriendly bipartition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Infinite graphs (05C63)

Related Items (5)

Duality theorems for stars and combs I: Arbitrary stars and combs ⋮ End‐faithful spanning trees in graphs without normal spanning trees ⋮ Majority choosability of countable graphs ⋮ Unfriendly partitions for graphs not containing a subdivison of an infinite cycle ⋮ Stabilization Time in Weighted Minority Processes

Cites Work

• Unnamed Item
• Ein Ordnungsbegriff für Graphen ohne unendliche Wege mit einer Anwendung auf n-fach zusammenhaengende Graphen
• Unfriendly partitions of a graph

This page was built for publication: Every rayless graph has an unfriendly partition