On the construction of certain graphs

Andrasfai, 1964, Graphentheoretische Extremalprobleme, Acta Math. Acad. Sci. Hungar., 15, 413, 10.1007/BF01897150 Erdös, 1935, A Combinatorial Problem in Geometry, Compositio Math., 2, 463 Erdös, 1957, Remarks on a Theorem of Ramsay, Bull. Res. Council Israel Sect. F, 7, 21 Erdös, 1961, Graph Theory and Probability, II, Canad. J. Math., 13, 346, 10.4153/CJM-1961-029-9 Erdös, 1960, A Construction of Graphs without Triangles Having Pre-assigned Order and Chromatic Number, J. London Math. Soc., 35, 445, 10.1112/jlms/s1-35.4.445 Kleitman, 1966, Families of Non-disjoint Subsets, Journal of Combinatorial Theory, 1, 153, 10.1016/S0021-9800(66)80012-1 F. P. Ramsay, Collected papers, pp. 82–111; see also reference 2. Turan, 1954, On the Theory of Graphs, Colloq. Math., 3, 19, 10.4064/cm-3-1-19-30