1. N. Alon andK. Berman, Regular hypergraphs, Gordon’s lemma, steinitz’ lemma and invariant theory,to appear in J. Combinatorial Theory, Ser. A.
2. J. Beck, Balanced 2-colorings of finite sets in the square I,Combinatorica,1 (1981), 327–335.
3. J. Beck andT. Fiala, “Integer-making” theorems,Discrete Applied Math,3 (1981), 1–8.
4. P. Erdős andV. T. Sós,private communication.
5. J. E. Graver, A survey of the maximum depth problem for indecomposable exact covers,in: Infinite and Finite Sets, Col. Math. János Bolyai, (1973) 731–743.