The homomorphism characterization of Weisfeiler–Leman
Lax119563.HomomorphismCharacterization · concepts/Lax119563/HomomorphismCharacterization.lean · lax-119563
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Dvořák, and Dell, Grohe and Rattan: let and let be colored graphs. Then -WL distinguishes and if and only if there is a colored graph with and .
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax119563.ColoredHomomorphisms |
| 2 | import Lax119563.WeisfeilerLeman |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: The homomorphism characterization of Weisfeiler–Leman |
| 7 | type: theorem |
| 8 | --- |
| 9 | Dvořák, and Dell, Grohe and Rattan: let and let be colored graphs. Then |
| 10 | -WL distinguishes and if and only if there is a colored graph with |
| 11 | and . |
| 12 | -/ |
| 13 | |
| 14 | open Lax119563.ColoredGraphs Lax119563.WeisfeilerLeman Lax119563.ColoredHomomorphisms |
| 15 | |
| 16 | namespace 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`. -/ |
| 20 | axiom 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 | |
| 23 | end Lax119563.HomomorphismCharacterization |
| 24 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments