1. Blanchard, Bull. Assoc. Proc. Math. No. 300 (1975), p. 538.
2. W. G. Brown, On graphs that do not contain a Thomsen graph,Bull. Canad. Math. Soc. 9 (1966), 281–288.
3. P. Erdös, On sequences of integers no one of which divides the product of two others and on some related problems,Mitteilungen des Forschungsinstitutes für Math. und Mechanik, Tomsk 2 (1938), 74–82.
4. P. Erdös, Problems and results in combinatorial analysis,Proc. of the Eighth Southeastern Conf. on Combinatorics, Graph Theory and Computing, Baton Rouge 1977, Louisiana State Univ.,Congr. Numerantium XIX, 3–12.
5. P. Erdös andD. J. Kleitman, On coloring graphs to maximize the proportion of multicoloredk-edges,J. Combinatorial Th. 5 (1968), 164–169.