Wiki
Wiki

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 kk and λ\lambda a balanced incomplete block design on vv points with block size kk and index λ\lambda exists for all sufficiently large vv satisfying λ(v−1)≡0(modk−1)\lambda(v-1)\equiv0\pmod{k-1} and λv(v−1)≡0(modk(k−1))\lambda v(v-1)\equiv0\pmod{k(k-1)}, and that the same holds for pairwise balanced designs whose block sizes lie in a given set KK. For λ=1\lambda=1 the congruences are the divisibility conditions of Problem 722 for r=2r=2, (k−1)∣(n−1)(k-1)\mid(n-1) and k(k−1)∣n(n−1)k(k-1)\mid n(n-1), so the answer is yes for (r,k)=(2,k)(r,k)=(2,k) and every kk: there is n0(k)n_0(k) such that every n>n0n>n_0 satisfying them carries a Steiner system S(2,k,n)S(2,k,n). 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 (n2)(k2)−1\binom n2\binom k2^{-1}, and asks there whether it extends to every rr, the question the problem poses. The site credits the case (2,k)(2,k) to Wilson under its key [Wi72], Part II.

Covers. The case r=2r=2 of the problem for every kk: for fixed kk and all large nn the divisibility conditions suffice for a Steiner system S(2,k,n)S(2,k,n). The theorem says nothing about r≥3r\ge3; 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.