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

The homomorphism characterization of Weisfeiler–Leman

Lax119563.HomomorphismCharacterization · concepts/Lax119563/HomomorphismCharacterization.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

    Dvořák, and Dell, Grohe and Rattan: let k≥2k \geq 2 and let G,HG, H be colored graphs. Then kk-WL distinguishes GG and HH if and only if there is a colored graph FF with tw⁡(F)≤k\operatorname{tw}(F) \leq k and hom⁡(F,G)≠hom⁡(F,H)\hom(F, G) \neq \hom(F, H).

    Concept map
    5 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.ColoredHomomorphisms
    2import Lax119563.WeisfeilerLeman
    3
    4/-!
    5---
    6title: The homomorphism characterization of Weisfeiler–Leman
    7type: theorem
    8---
    9Dvořák, and Dell, Grohe and Rattan: let k≥2k \geq 2 and let G,HG, H be colored graphs. Then
    10kk-WL distinguishes GG and HH if and only if there is a colored graph FF with
    11tw⁡(F)≤k\operatorname{tw}(F) \leq k and hom⁡(F,G)≠hom⁡(F,H)\hom(F, G) \neq \hom(F, H).
    12-/
    13
    14open Lax119563.ColoredGraphs Lax119563.WeisfeilerLeman Lax119563.ColoredHomomorphisms
    15
    16namespace Lax119563.HomomorphismCharacterization
    17
    18/-- `k`-WL distinguishes `G` and `H` if and only if some colored graph of treewidth at most
    19`k` has different numbers of homomorphisms to `G` and to `H`. -/
    20axiom distinguishes_iff_exists_hom_ne {k : ℕ} (hk : 2 ≤ k) (G H : ColoredGraph) :
    21 Distinguishes k G H ↔ ∃ F : ColoredGraph, TreewidthAtMost F k ∧ hom F G ≠ hom F H
    22
    23end Lax119563.HomomorphismCharacterization
    24
    Show Proof
    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…