This is a preview of subscription content, log in via an institution to check access.
Literature cited
W. Mantel, Vraagstuk XXVIII, Wiskundige Opgevan met de Oplossingen,10, No. 1, 60–61 (1907).
P. Turan, “Egy grafelmeleti szelsöerekfeladatrol,” Mat. Fiz. Lapok,48, No. 3, 436–453 (1941).
P. Erdös, “On the combinatorial problems which I would most like to see solved,” Combinatorica,1, No. 1, 25–42 (1981).
B. Bollobas, “Three-graphs without two triples whose symmetric difference is contained in a third,” Discrete Math.,8, No. 1, 21–24 (1974).
P. Erdös and M. Simonovits, “Compactness results in extremal graph theory,” Combinatorica,2, No. 3, 275–288 (1982).
M. Simonovits, Extremal Graph Theory. Selected Topics in Graph Theory, Academic Press, New York (1983), pp. 161–200.
W. G. Brown and M. Simonovits, “Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures,” Discrete Math.,48, Nos. 2–3, 147–162 (1984).
T. S. Motzkin and E. G. Straus, “Maxima for graphs and a new proof of a theorem of Turan,” Can. J. Math.,17, No. 4, 533–540 (1965).
P. Erdos and M. Simonovits, “A limit theorem in graph theory,” Stud. Math. Hung.,1, Nos. 1–2, 51–57 (1966).
P. Cameron and J. van Lindt, The Theory of Graphs, Coding Theory, and Block-Schemes [Russian translation], Nauka, Moscow (1982).
K. A. Rybnikova (ed.), Combinatorial Analysis. Problems and Exercises [in Russian], Nauka, Moscow (1982).
Author information
Authors and Affiliations
Additional information
Translated from Matematicheskie Zametki, Vol. 41, No. 3, pp. 433–455, March, 1987.
Rights and permissions
About this article
Cite this article
Sidorenko, A.F. The maximal number of edges in a homogeneous hypergraph containing no prohibited subgraphs. Mathematical Notes of the Academy of Sciences of the USSR 41, 247–259 (1987). https://doi.org/10.1007/BF01158259
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01158259