While this submission is a draft, it cannot be used by other submissions.

Stabilization of k-WL

Lax119563.Stabilization · concepts/Lax119563/Stabilization.lean · lax-119563

proven

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural Language Statement

    Theorem

    Theorem (Döring and Neuen). Let k≥2k \geq 2 be fixed. On every colored graph with nn vertices, kk-WL stabilizes after Ok(nk−1)O_k(n^{k-1}) rounds.

    More precisely, Döring and Neuen prove the bound 5(n−1)5(n - 1) for k=2k = 2 and the bound O(nk−1/(k−2)!+nk−2)O(n^{k-1}/(k-2)! + n^{k-2}) for k≥3k \geq 3.

    Concept map
    3 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax119563.WeisfeilerLeman
    2
    3/-!
    4---
    5title: Stabilization of k-WL
    6type: theorem
    7---
    8**Theorem** (Döring and Neuen). Let k≥2k \geq 2 be fixed. On every colored graph with nn
    9vertices, kk-WL stabilizes after Ok(nk−1)O_k(n^{k-1}) rounds.
    10
    11More precisely, Döring and Neuen prove the bound 5(n−1)5(n - 1) for k=2k = 2 and the bound
    12O(nk−1/(k−2)!+nk−2)O(n^{k-1}/(k-2)! + n^{k-2}) for k≥3k \geq 3.
    13
    14# Implementation notes
    15
    16The constant hidden in OkO_k is made explicit: there is a CC, depending on kk only, such
    17that kk-WL stabilizes after some number r≤Cnk−1r \leq C n^{k-1} of rounds on every colored graph
    18with nn vertices.
    19-/
    20
    21open Lax119563.ColoredGraphs Lax119563.WeisfeilerLeman
    22
    23namespace Lax119563.Stabilization
    24
    25/-- **Stabilization bound.** For `k ≥ 2`, `k`-WL stabilizes after `O_k(n ^ (k - 1))` rounds
    26on every colored graph with `n` vertices. -/
    27axiom stabilization_bound (k : ℕ) (hk : 2 ≤ k) :
    28 ∃ C : ℕ, ∀ G : ColoredGraph, ∃ r ≤ C * G.n ^ (k - 1), StabilizesAfter k r G
    29
    30end Lax119563.Stabilization
    31
    Show Proof

    Implementation notes

    The constant hidden in OkO_k is made explicit: there is a CC, depending on kk only, such that kk-WL stabilizes after some number r≤Cnk−1r \leq C n^{k-1} of rounds on every colored graph with nn vertices.

    Builds on
    Used by

    none

    From Mathlib

    none

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…