Hypergraph Colouring Bounds
From MaRDI portal
- A graph library for Isabelle
- A modular first formalisation of combinatorial design theory
- Counting Steiner triple systems
- Exploring the structure of an algebra text with locales
- Formalising Szemerédi's regularity lemma in Lean
- Formalising the Kruskal-Katona theorem in Lean
- Graph colouring and the probabilistic method
- Interactive simplifier tracing and debugging in Isabelle
- Interpretation of Locales in Isabelle: Theories and Proof Contexts
- Isabelle/HOL. A proof assistant for higher-order logic
- Locales: a module system for mathematical theories
- Markov chains and Markov decision processes in Isabelle/HOL
- Proof pearl: a probabilistic proof for the girth-chromatic number theorem
- Simple type theory is not too simple: Grothendieck's schemes without dependent types
- The K-book. An introduction to algebraic K-theory
- The probabilistic method
- Tutorial to locales and locale interpretation
- Types for Proofs and Programs
This page was built for software: Hypergraph Colouring Bounds
