Every rayless graph has an unfriendly partition


We prove that every rayless graph has an unfriendly partition.

This is a preview of subscription content, access via your institution.


  1. [1]

    R. Aharoni, E. C. Milner and K. Prikry: Unfriendly partitions of a graph, J. Combin. Theory (Series B)50 (1990), 1–10.

    MathSciNet  MATH  Article  Google Scholar 

  2. [2]

    R. Diestel: Graph Theory (4th edition), Springer-Verlag, 2010. Electronic edition available at: http://diestel-graph-theory.com.

  3. [3]

    R. Schmidt: Ein Ordnungsbegriff für Graphen ohne unendliche Wege mit einer Anwendung auf n-fach zusammenhängende Graphen, Arch. Math.40 (1983), 283–288.

    MATH  Article  Google Scholar 

  4. [4]

    S. Shelah and E. C. Milner: Graphs with no unfriendly partitions, in: A tribute to Paul Erdős, pages 373–384, Cambrigde Univ. Press, 1990.

Download references

Author information



Corresponding author

Correspondence to Henning Bruhn.

Additional information

Supported by a GIF grant.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Bruhn, H., Diestel, R., Georgakopoulos, A. et al. Every rayless graph has an unfriendly partition. Combinatorica 30, 521–532 (2010). https://doi.org/10.1007/s00493-010-2590-3

Download citation

Mathematics Subject Classification (2000)

  • 05C99