1. B. Bollobás,Extremal Graph Theory, Academic Press, 1978.
2. B. Bollobás, On complete subgraphs of different orders,Math. Proc. Cambridge Philos. Soc. 79 (1976), 19–24.
3. P. Erdős, Some unsolved problems in graph theory and combinatorial analysis,Combinatorial Mathematics and Its Applications (Proc. Conf., Oxford, 1969), Academic Press, 1971, 97–109.
4. P. Erdős, A. Goodman andL. Pósa, The representation of graphys by set intersections,Canad. J. Math. 18 (1966), 106–112.
5. E. Győri, On the number of edge disjoint triangles in graphs of given size, Combinatorics,Proceedings of the 7-th Hungarian Combinatorial Colloquium, 1987, Eger, 267–276.