| A modular first formalisation of combinatorial design theory C Edmonds, LC Paulson International Conference on Intelligent Computer Mathematics, 3-18, 2021 | 9 | 2021 |
| Formalising Szemerédi’s regularity lemma and Roth’s theorem on arithmetic progressions in Isabelle/HOL C Edmonds, A Koutsoukou-Argyraki, LC Paulson Journal of Automated Reasoning 67 (1), 2, 2023 | 6 | 2023 |
| A formalisation of the Balog–Szemerédi–Gowers theorem in Isabelle/HOL A Koutsoukou-Argyraki, M Bakšys, C Edmonds Proceedings of the 12th ACM SIGPLAN International Conference on Certified …, 2023 | 5 | 2023 |
| Undirected graph theory C Edmonds Archive of Formal Proofs, 2022 | 5 | 2022 |
| Roth’s Theorem on Arithmetic Progressions C Edmonds, A Koutsoukou-Argyraki, LC Paulson Archive of Formal Proofs, 2021 | 5 | 2021 |
| Szemerédi’s Regularity Lemma C Edmonds, A Koutsoukou-Argyraki, LC Paulson Archive of Formal Proofs, 2021 | 4 | 2021 |
| The Balog–Szemerédi–Gowers Theorem A Koutsoukou-Argyraki, M Bakšys, C Edmonds Archive of Formal Proofs, 2022 | 2 | 2022 |
| Formalising Fisher's Inequality: Formal Linear Algebraic Proof Techniques in Combinatorics C Edmonds, LC Paulson arXiv preprint arXiv:2207.02728, 2022 | 1 | 2022 |
| Fisher’s inequality: Linear algebraic proof techniques for combinatorics C Edmonds, LC Paulson Archive of Formal Proofs, 2022 | 1 | 2022 |
| Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local Lemma L Paulson, C Edmonds | | 2024 |
| Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local Lemma C Edmonds, LC Paulson Proceedings of the 13th ACM SIGPLAN International Conference on Certified …, 2024 | | 2024 |
| Hypergraph Colouring Bounds using Probabilistic Methods C Edmonds, LC Paulson | | 2023 |
| Formal Probabilistic Methods for Combinatorial Structures in Isabelle/HOL C Edmonds, LC Paulson arXiv preprint arXiv:2310.00513, 2023 | | 2023 |
| Design Theory C Edmonds, L Paulson | | 2023 |
| Lucas’s Theorem C Edmonds | | 2023 |
| An Introduction to the Probabilistic Method for Combinatorics in Isabelle/HOL C Edmonds | | |
