Tag Archives: Designs

Amazing: Peter Keevash Constructed General Steiner Systems and Designs

Here is one of the central and oldest problems in combinatorics: Problem: Can you find a collection S of q-subsets from an n-element set X set so that every r-subset of X is included in precisely λ sets in the collection? … Continue reading

Posted in Combinatorics, Open problems | Tagged , , | 11 Comments