This is a preview of subscription content, log in via an institution to check access.
Literature cited
P. Turán, “Research problems,” Magyar Tud. Akad. Mat. Kutató Int. Kozl.,6, No. 3, 417–423 (1961).
A. E. Brouwer, “Packing and covering of (t k) -sets,” Math. Centre Tracts,106, 89–97 (1979).
W. H. Mills, “Covering designs I: coverings by a small number of subsets,” ARS Combinatoria,8, 199–315 (1979).
N. N. Kuzyurin, “Recurrence and asymptotic estimates in the covering problem,” Mat. Zametki,26, No. 4, 603–611 (1979).
P. Turán, “Egy gráfelméleti szélsöértekfeladatrol,” Mat. Fiz. Lapok,48, No. 3, 436–453 (1941).
W. Mantel, “Vraagstuk XXVIII,” Wiskundige Opgaven met de Oplossingen,10, No. 1, 60–61 (1907).
A. F. Sidorenko, “Turan's problem for 3-graphs,” in: Combinatorial Analysis [in Russian], Vol. 6, Moscow State Univ. (1983), pp. 51–57.
M. Lorea, “On Turan hypergraphs,” Discrete Math.,22, No. 3, 281–289 (1978).
A. F. Sidorenko, “Turan numbers T(n, 5, 4) and the number of monochromatic 4-cliques in a 2-colored 3-graph,” Vopr. Kibern., No. 64, 117–124 (1980).
A. F. Sidorenko, “Extremal constants and inequalities for distributions of sums of random vectors,” Dissertation, Moscow State Univ. (1982).
H. L. Abbott, D. Hanson, and A. C. Liu, “An extremal problem in graph theory,” Quart. J. Math.,31, No. 121, 1–7 (1980).
Author information
Authors and Affiliations
Additional information
Translated from Matematicheskie Zametki, Vol. 42, No. 5, pp. 751–760, November, 1987.
Rights and permissions
About this article
Cite this article
Sidorenko, A.F. Precise values of turan numbers. Mathematical Notes of the Academy of Sciences of the USSR 42, 913–918 (1987). https://doi.org/10.1007/BF01137440
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01137440