Formalisation of the Cambridge Part II and Part III courses Graph Theory, Combinatorics, Extremal and Probabilistic Combinatorics in Lean
-
Updated
Jun 6, 2025 - Lean
8000
Formalisation of the Cambridge Part II and Part III courses Graph Theory, Combinatorics, Extremal and Probabilistic Combinatorics in Lean
Formalisation of the Kelley-Meka bound on Roth numbers
The (currently unofficial) sublibrary of Mathlib dedicated to additive combinatorics
Formalisation in the Lean theorem prover of the relation between corner-free sets and communication complexity
AddComb.js is a javascript library for additive combinatorics calculation.
Miscellaneous projects I am working on in Lean
Add a description, image, and links to the additive-combinatorics topic page so that developers can more easily learn about it.
To associate your repository with the additive-combinatorics topic, visit your repo's landing page and select "manage topics."