Zusammenfassung
The idea that those different from you are ünfriendly" is captured in the
definition of unfriendly 2-colorings in graph theory in a paper by Aharoni,
Milner and Prikry, where they prove that every finite graph has an unfriendly
coloring. We give a more general definition for all n>1, that we call
"integrated" rather than ünfriendly." Then we prove that every finite graph
has an integrated n-coloring, n>1. We then give some applications to various
graph coloring problems and to some max-cut problems.
Nutzer