, Volume 37, Issue 2, pp 157–166 | Cite as

Unfriendly partitions for graphs not containing a subdivision of an infinite clique

Original Paper


We prove that in any graph containing no subdivision of an infinite clique there exists a partition of the vertices into two parts, satisfying the condition that every vertex has at least as many neighbors in the part not containing it as it has in its own part.

Mathematics Subject Classification (2000)



Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R. Aharoni, E. C. Milner and K. Prikry: Unfriendly partitions of a graph, Jour. Combin. Theo. Sir. B. 50 (1990), 1–10.MathSciNetCrossRefMATHGoogle Scholar
  2. [2]
    H. Bruhn, R. Diestel, A. Georgakopoulos and P. Sprüssel: Every rayless graph has an unfriendly partition, Combinatorica 30 (2010), 521–532.MathSciNetCrossRefMATHGoogle Scholar
  3. [3]
    R. Cowan and W. Emerson: Proportional colorings of graphs, unpublished.Google Scholar
  4. [4]
    F. Galvin: Indeterminacy of point-open games, Bull. Acad. Polon. Sci., Ser. Math. 26 (1978), 445–449.MathSciNetMATHGoogle Scholar
  5. [5]
    E. C. Milner and S. Shelah: Graphs with no unfriendly partitions, in: A tribute to Paul Erdös, 373–384, Cambridge Univ. Press, Cambridge, 1990.Google Scholar
  6. [6]
    N. Robertson, P. D. Seymour and R. Thomas: Excluding subdivisions of infinite cliques, Trans. Amer. Math. Soc. 332 (1992), 211–223.MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© János Bolyai Mathematical Society and Springer-Verlag Berlin Heidelberg 2017

Authors and Affiliations

  1. 1.Department of Mathematics Faculty of ScienceUniversity of HaifaHaifaIsrael

Personalised recommendations