Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. Part III of Wilson's An existence theory for pairwise balanced designs, subtitled Proof of the existence conjectures, states in its abstract that for positive integers and a balanced incomplete block design on points with block size and index exists for all sufficiently large satisfying and , and that the same holds for pairwise balanced designs whose block sizes lie in a given set . For the congruences are the divisibility conditions of Problem 722 for , and , so the answer is yes for and every : there is such that every satisfying them carries a Steiner system . Parts I and II (1972) build the theory the proof uses, composition theorems for pairwise balanced designs and the structure of the sets of orders closed under them, and Part II states the existence conjectures that Part III proves. Erdős states the theorem in [Er81], Part VI, with the block count , and asks there whether it extends to every , the question the problem poses. The site credits the case to Wilson under its key [Wi72], Part II.
Covers. The case of the problem for every : for fixed and all large the divisibility conditions suffice for a Steiner system . The theorem says nothing about ; the general case is Keevash's existence of designs.
Acceptance. Refereed: R. M. Wilson, An existence theory for pairwise
balanced designs. III. Proof of the existence conjectures, J. Combin. Theory
Ser. A 18 (1975), no. 1, 71–79, completing Parts I and II, J. Combin.
Theory Ser. A 13 (1972), 220–245 and 246–273; the issue of Part III is
dated January 1975, and the page is dated to the first day of that month.
The site's curator names Wilson's case in the progression that ends with
Keevash while crediting the problem's PROVED label to Keevash, which does
not settle the problem on this result, so the page lists no reviewed
evidence. The proof has not been reconstructed or independently reviewed in
this corpus.