Graphons in Lean 4 — cut distance, regularity, counting lemma, compactness, and convergence equivalence, built on Mathlib
-
Updated
Mar 20, 2026 - Lean
Graphons in Lean 4 — cut distance, regularity, counting lemma, compactness, and convergence equivalence, built on Mathlib
Add a description, image, and links to the graph-limits topic page so that developers can more easily learn about it.
To associate your repository with the graph-limits topic, visit your repo's landing page and select "manage topics."