1. N. Alon, Decomposition of the complete r-graph into complete r-partite r-graphs, Graphs and Combinatorics 2 (1986), 95–100.
2. N. Alon, R. A. Brualdi and B. L. Shader, Multicolored forests in bipartite decompositions of graphs, J. Combinatorial Theory, Ser. B (1991), 143–148.
3. N. G. de Bruijn and P. Erdős, On a combinatorial problem, Indagationes Math. 20 (1948), 421–423.
4. P. Erdős, On sequences of integers none of which divides the product of two others, and related problems, Mitteilungen des Forschungsinstituts für Mat. und Mech., Tomsk, 2 (1938), 74–82.
5. P. Erdős and G. Purdy, Some extremal problems in combinatorial geometry, in: Handbook of Combinatorics (R. L. Graham, M. Grötschel and L. Lovász eds.), North Holland, to appear.