Formalising the Kruskal-Katona Theorem in Lean-Reference-Cited by-同舟云学术

Formalising the Kruskal-Katona Theorem in Lean

Published:2022 Issue: Volume: Page:75-91
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Mehta Bhavik^ORCID

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-16681-5_5

Reference21 articles.

1. Alon, N.: Problems and results in extremal combinatorics-III. J. Comb. 7(2), 233–256 (2016)

2. Anderson, I.: Combinatorics of Finite Sets. Courier Corporation (2002)

3. Bollobás, B.: On generalized graphs. Acta Math. Hungar. 16(3–4), 447–452 (1965)

4. Bollobás, B., Béla, B.: Combinatorics: Set Systems, Hypergraphs, Families of Vectors, and Combinatorial Probability. Cambridge University Press, Cambridge (1986)

5. Bollobás, B., Leader, I.: Compressions and isoperimetric inequalities. J. Comb. Theory Ser. A 56(1), 47–62 (1991)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local Lemma;Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs;2024-01-09

2. Formalizing Finite Ramsey Theory in Lean 4;Lecture Notes in Computer Science;2024

3. Formalising Sharkovsky’s Theorem (Proof Pearl);Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs;2023-01-11

4. A Formalisation of the Balog–Szemerédi–Gowers Theorem in Isabelle/HOL;Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs;2023-01-11