Six rounds of the unfriendly partition game on every countable graph
ProvedTenChallenges.challenge_10_r6combinatoricsgraph-theoryinfinite-graphsten-challenges
Let be a countable simple graph. Start the unfriendly partition game with every vertex uncoloured and with ordinal clock . Partitioner has a winning strategy. At each move Challenger chooses a vertex and a smaller ordinal. Partitioner extends the current partial two-colouring on a finite domain so that the queried vertex has at least as many assigned neighbours of the opposite colour as of its own colour. The strategy must handle every such sequence of choices until the clock reaches zero.
Preamble
import Definitions.Def_TenChallenges_Challenge_10 universe u v
Formal statement
namespace TenChallenges
theorem challenge_10_r6 : statement_10.{u, v} 6 := by sorry
end TenChallengesSource
Ten Challenges in Combinatorics, Challenge 10 at ordinal clock 6. https://tenchallenges.github.io/ten-challenges/