diff --git a/LeanEval/Combinatorics/DesignsExist.lean b/LeanEval/Combinatorics/DesignsExist.lean
new file mode 100644
index 000000000..e582417b7
--- /dev/null
+++ b/LeanEval/Combinatorics/DesignsExist.lean
@@ -0,0 +1,98 @@
+import Mathlib
+import EvalTools.Markers
+
+/-!
+# Existence of designs
+
+Peter Keevash showed in 2014 that designs of parameters (n, q, r, λ) exist provided
+n is sufficiently large (given fixed q, r, λ).
+
+We include multiple related results with similar methods of proof in this challenge
+to encourage production of reusable code.
+
+## References
+
+* Peter Keevash. The existence of designs. https://arxiv.org/abs/1401.3665
+* Peter Keevash. The existence of designs II. https://people.maths.ox.ac.uk/keevash/papers/designsII.pdf
+* Peter Keevash. Counting designs. https://arxiv.org/abs/1504.02909
+* Peter Keevash, Ashwin Sah, Mehtaab Sawhney. The existence of subspace designs. https://arxiv.org/abs/2212.00870
+* Stefan Glock, Daniela Kühn, Allan Lo, Deryk Osthus. The existence of designs via iterative absorption: hypergraph F-designs for arbitrary F. https://arxiv.org/abs/1611.06827
+* W. T. Gowers. Probabilistic combinatorics and the recent work of Peter Keevash. https://www.ams.org/journals/bull/2017-54-01/S0273-0979-2016-01553-9/S0273-0979-2016-01553-9.pdf
+* Gil Kalai. Designs Exist! [after Peter Keevash] http://www.bourbaki.ens.fr/TEXTES/1100.pdf
+* https://aperiodical.com/2014/01/proof-news-designs-exist/ includes links to multiple blog posts.
+-/
+namespace LeanEval.Combinatorics.DesignsExist
+
+/-- The type of designs with parameter (#X, q, r, lam). -/
+structure Design (X : Type*) (q r lam : ℕ) where
+  blocks : Set (Set X)
+  card_blocks : ∀ s ∈ blocks, s.encard = q
+  card_subset : ∀ s : Set X, s.encard = r → {b ∈ blocks | s ⊆ b}.encard = lam
+
+/-- The obvious necessary condition for a design of given parameters to exist. -/
+def DivisibilityCondition (n q r lam : ℕ) : Prop :=
+  ∀ i ∈ Finset.range r, (q - i).choose (r - i) ∣ lam * (n - i).choose (r - i)
+
+/-- Existence of designs. Theorem 0.1 in Kalai's Bourbaki notes. -/
+@[eval_problem]
+theorem keevash (q r lam : ℕ+) (hrq : r < q) :
+    ∃ N : ℕ, ∀ n > N, DivisibilityCondition n q r lam → Nonempty (Design (Fin n) q r lam) := by
+  sorry
+
+/-- Asymptotics on the number of Steiner triple systems: if n is 1 or 3 mod 6, then
+the number of Steiner triple systems on n vertices is (n/e² + o(n)) ^ (n²/6).
+Theorem 2.2 of *Counting designs*. -/
+@[eval_problem]
+theorem steiner_triple_asymptotics :
+    (fun n : ℕ ↦ Nat.card (Design (Fin n) 3 2 1) ^ (6 / n ^ 2 : ℝ) -
+      if 6 ∣ (n + 5) ∨ 6 ∣ (n + 3) then n / Real.exp 2 else 0) =o[Filter.atTop] ((↑) : ℕ → ℝ) := by
+  sorry
+
+/-- Existence of resolvable designs (for which the set of blocks can be partitioned into partitions.
+Theorem 1.1 in *The existence of designs II*. -/
+@[eval_problem]
+theorem keevash_resolvable (q r lam : ℕ+) (hrq : r < q) :
+    ∃ N : ℕ, ∀ n > N, DivisibilityCondition n q r lam → (q : ℕ) ∣ n →
+      ∃ d : Design (Fin n) q r lam, ∃ p : Partition d.blocks,
+        ∀ s ∈ p, ∃ p' : Partition (.univ : Set (Fin n)), p' = s := by
+  sorry
+
+/-- Existence of a large set of designs. Theorem 1.2 in *The existence of designs II*. -/
+@[eval_problem]
+theorem keevash_large_set (q r : ℕ+) (hrq : r ≤ q) :
+    ∃ N : ℕ, ∀ n > N, ∀ lam : ℕ+, DivisibilityCondition n q r lam →
+      (lam : ℕ) ∣ (n - r : ℕ).choose (q - r) →
+      ∃ p : Partition {s : Set (Fin n) | s.encard = q},
+        ↑p ⊆ Set.range fun d : Design (Fin n) q r lam ↦ d.blocks := by
+  sorry
+
+/-- Existence of a complete resolution of Kₙ^q. Theorem 1.3 in *The existence of designs II*. -/
+@[eval_problem]
+theorem keevash_complete_resolution (q : ℕ+) :
+    ∃ N : ℕ, ∀ n > N, (∀ i ≤ q, (i : ℕ) ∣ (n - q)) →
+      ∃ s : Π i : Fin q, Set (Design (Fin n) q (i + 1) 1),
+        (s (.rev 0)).encard = 1 ∧ ∀ i j : Fin q, i ≤ j →
+          ∀ d ∈ s j, ∃ p : Partition d.blocks, ↑p ⊆ Design.blocks '' s i := by
+  sorry
+
+/-- The type of subspace designs with parameter (dim V, s, r, lam). -/
+structure SubspaceDesign (K V : Type*) [DivisionRing K] [AddCommGroup V] [Module K V]
+    (s r lam : ℕ) where
+  subspaces : Set (Subspace K V)
+  rank_subspaces : ∀ W ∈ subspaces, Module.rank K W = s
+  card_subset : ∀ U : Subspace K V, Module.rank K U = r → {W ∈ subspaces | U ≤ W}.encard = lam
+
+/-- q-binomial coefficients. -/
+def qChoose (q n k : ℕ) :=
+  let prod (n : ℕ) := ∏ i ∈ Finset.Icc 1 n, (q ^ i - 1)
+  prod n / (prod k * prod (n - k))
+
+/-- Existence of subspace designs: Theorem 1.4 in the paper by Keevash, Sah and Sawhney. -/
+@[eval_problem]
+theorem keevash_sah_sawhney (K : Type*) [Finite K] [Field K] (s r : ℕ) (lt : r < s) (lam : ℕ+) :
+    ∃ N, ∀ n > N, let q := Nat.card K
+      (∀ i ∈ Finset.range r, qChoose q (s - i) (r - i) ∣ lam * qChoose q (n - i) (r - i)) →
+      Nonempty (SubspaceDesign K (Fin n → K) s r lam) := by
+  sorry
+
+end LeanEval.Combinatorics.DesignsExist
diff --git a/manifests/problems/designs_exist.toml b/manifests/problems/designs_exist.toml
new file mode 100644
index 000000000..be5ae3380
--- /dev/null
+++ b/manifests/problems/designs_exist.toml
@@ -0,0 +1,12 @@
+id = "designs_exist"
+title = "The existence of designs"
+group = "formalization-evaluation"
+status = "draft"
+visible = true
+statement_revision = 1
+tags = []
+test = false
+module = "LeanEval.Combinatorics.DesignsExist"
+holes = ["keevash", "steiner_triple_asymptotics", "keevash_resolvable", "keevash_large_set", "keevash_complete_resolution", "keevash_sah_sawhney"]
+notes = "Keywords: probabilistic method, randomized algebraic constructions, absorption."
+submitter = "Junyan Xu"