Mission
Existence of Steiner systems
Log in to contributeGoal
An -Steiner system is a set of -subsets of , called blocks, such that every -subset of is contained in exactly one block.
This mission has three main goals:
namespace SteinerSystem
open Filter in
theorem keevash {n k t : ℕ} (ht : 1 ≤ t) (hk : t < k)
(hn : (4 * k) ^ (90 * k * (2 * k) ^ t * (6 * k.choose t) ^ 2) < n)
(dn : ∀ i < t, (k - i).choose (t - i) ∣ (n - i).choose (t - i)) :
Nonempty (SteinerSystem n k t) :=
sorry
end SteinerSystemIf , and satisfies the necessary condition of SteinerSystem.param_dvd, an -Steiner system exists.
No submissions yet on this mission's goal. Log in and be the first to prove it.