Challenge 10: global unfriendly partitions iff every ordinal clock is winning
ProvedTenChallenges.unfriendly_partition_iff_all_clockscombinatoricsgraph-theoryinfinite-graphsten-challenges
Let be a countable simple graph. A two-coloring is unfriendly if each vertex has at least as many neighbors of the opposite color as of its own color. Then
In the game, Challenger chooses a vertex and a strictly smaller ordinal clock; Partitioner responds with a finite extension of the current partial coloring that is unfriendly at the queried vertex. This equivalence relates the global existence question to the complete family of scaled games. It does not assert that either condition holds for every countable graph.
Formalization note: if , the clock quantifier ranges over . The formal coloring has type ; unfriendliness at every vertex requires the coloring to be total.
Preamble
import Definitions.Def_TenChallenges_Challenge_10 universe u
Formal statement
namespace TenChallenges
theorem unfriendly_partition_iff_all_clocks {V : Type u} [Countable V]
(G : SimpleGraph V) :
(∃ p : V → Option Bool, ∀ x, UnfriendlyAt G p x) ↔
∀ α : Ordinal.{u}, PartitionerWins G (emptyPartition V) α := by sorry
end TenChallengesSource
Ten Challenges in Combinatorics, Challenge 10; equivalence between the global unfriendly partition assertion and its full family of ordinal-clock games, using canonical definitions. https://tenchallenges.github.io/ten-challenges/