Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Challenge 10: every ordinal clock under finite hub co-occurrence on finite-degree components

Proved
TenChallenges.challenge_10_finiteCooccurrence

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

combinatoricsgraph-theoryinfinite-graphsten-challengesunfriendly-partition

Let G=(V,E)G=(V,E)G=(V,E) be a countable simple graph. Partition VVV into the set F={x∈V:deg⁡G(x)<∞}F=\{x\in V : \deg_G(x)<\infty\}F={x∈V:degG​(x)<∞} of finite-degree vertices and the set I=V∖FI=V\setminus FI=V∖F of infinite-degree vertices (hubs), and let C\mathcal{C}C denote the set of connected components of the induced subgraph G[F]G[F]G[F]. Assume that:

  1. Every connected component C∈CC\in\mathcal{C}C∈C is finite, with no uniform upper bound on ∣C∣|C|∣C∣ or on the number of hubs adjacent to CCC.
  2. Any two distinct infinite-degree vertices x≠yx\neq yx=y in III are simultaneously adjacent to vertices of only finitely many components C∈CC\in\mathcal{C}C∈C:
∣{C∈C:NG(x)∩C≠∅ and NG(y)∩C≠∅}∣<∞.|\{C\in\mathcal{C} : N_G(x)\cap C\neq\varnothing \text{ and } N_G(y)\cap C\neq\varnothing\}| < \infty.∣{C∈C:NG​(x)∩C=∅ and NG​(y)∩C=∅}∣<∞.

Then Partitioner has a winning strategy in the unfriendly partitioning game from the empty partial coloring at every ordinal clock:

∀α∈Ord,PartitionerWins⁡(G,∅,α).\forall \alpha\in\mathrm{Ord},\quad \operatorname{PartitionerWins}(G,\varnothing,\alpha).∀α∈Ord,PartitionerWins(G,∅,α).

At each turn of the game, Challenger announces a vertex v∈Vv\in Vv∈V and a strictly smaller ordinal clock β<α\beta<\alphaβ<α, and Partitioner supplies a finite extension of the current partial 222-coloring on which vvv is colored and has at least as many colored neighbors of the opposite color as of its own color.

This establishes the all-ordinal-clocks game consequence of Challenge 10 for countable graphs whose finite-degree subgraph decomposes into finite components of arbitrary size and boundary cardinality with finite pairwise hub overlap, even when infinitely many hubs are present.

Formalization Note. Connected components of G[F]G[F]G[F] are represented as (G.induce {x : V | (G.neighborSet x).Finite}).ConnectedComponent with vertex support C.supp. The vertex type lives in Type u and the ordinal clock r lives in an independent Ordinal.{v}, using the canonical PartitionerWins and emptyPartition definitions from Definitions.Def_TenChallenges_Challenge_10. The unrestricted countable Unfriendly Partition Conjecture remains open.

Preamble
import Definitions.Def_TenChallenges_Challenge_10
import Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
import Mathlib.Data.Set.Card
universe u v
Formal statement
namespace TenChallenges
theorem challenge_10_finiteCooccurrence {V : Type u} [Countable V] (G : SimpleGraph V)
    (hfinite : ∀ C : (G.induce {x : V | (G.neighborSet x).Finite}).ConnectedComponent, C.supp.Finite)
    (hshare : ∀ x y : V, (G.neighborSet x).Infinite → (G.neighborSet y).Infinite → x ≠ y →
      {C : (G.induce {x : V | (G.neighborSet x).Finite}).ConnectedComponent |
        (∃ a ∈ C.supp, G.Adj x a.val) ∧ (∃ b ∈ C.supp, G.Adj y b.val)}.Finite)
    (r : Ordinal.{v}) : PartitionerWins G (emptyPartition V) r := by sorry
end TenChallenges
Source
Ten Challenges in Combinatorics, Challenge 10 (Unfriendly Partitioning Game), https://tenchallenges.github.io/ten-challenges/ ; background on unfriendly partitions of countable graphs in R. Aharoni, E. C. Milner, and K. Prikry, Unfriendly partitions of a graph, J. Combin. Theory Ser. B 50 (1990), 1-10, https://doi.org/10.1016/0095-8956(90)90092-E, and L. Aurichi and L. Real, Remarks on the countable case of the Unfriendly Partition Problem, https://arxiv.org/abs/2412.14151.

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