Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Challenge 10: all ordinal clocks on graphs with every degree infinite

Proved
TenChallenges.challenge_10_infiniteDegree

by kmehltretter82 · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsgraph-theoryinfinite-graphsten-challenges

Let G=(V,E)G=(V,E)G=(V,E) be a simple graph such that every vertex has infinitely many neighbors, and let f:V→{0,1,⊥}f:V\to\{0,1,\bot\}f:V→{0,1,⊥} be a partial coloring with finite colored domain. For every ordinal rrr, Partitioner has a winning strategy in the unfriendly partition game starting from fff:

PartitionerWins⁡(G,f,r).\operatorname{PartitionerWins}(G,f,r).PartitionerWins(G,f,r).

At each move, Challenger chooses a vertex and a strictly smaller ordinal clock. Partitioner must extend the current finite coloring so that the queried vertex has at least as many opposite-colored neighbors as same-colored neighbors. In particular, the conclusion holds from the empty coloring at every ordinal clock. This proves the infinite-degree-at-every-vertex case of Challenge 10; no countability assumption on VVV is required.

Preamble
import Definitions.Def_TenChallenges_Challenge_10
universe u v
Formal statement
namespace TenChallenges
theorem challenge_10_infiniteDegree {V : Type u} (G : SimpleGraph V)
    (hG : ∀ x, (G.neighborSet x).Infinite) (r : Ordinal.{v})
    {f : V → Option Bool} (hf : HasFiniteDomain f) : PartitionerWins G f r := by sorry
end TenChallenges
Source
Ten Challenges in Combinatorics, Challenge 10; infinite-degree special case using the canonical unfriendly-partition game definitions. https://tenchallenges.github.io/ten-challenges/

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me