Abstract
Taking an ordinary graphL 2 and replacing each of its vertices by a group ofr/2 vertices (r is even), we get anr-uniform hypergraphL′. In the casex(L 2)=2m+1, we solve asymptotically the Turán problem forL′. Ifx(L 2)#2m+1, the upper bound is still valid but proper constructions are not known.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Frankl, P.: Asymptotic solution of a Turán-type problem. Graphs and Combinatorics6, 223–227 (1990)
Erdös, P., Simonovits, M.: A limit theorem on graph theory. Studia Sci. Math. Hungar.1, 51–57 (1966)
Katona, G., Nemetz, T., Simonovits, M.: On a graph problem of Turán (in Hungarian). Mat. Lapok15, 228–238 (1964)
Sidorenko, A.F.: Extremal combinatorial problems for spaces with continuous measure (in Russian). In: Issledovanie Operatciy i ASU, Vol. 34, pp 34–40. Kiev: Vischa Shkola 1989
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sidorenko, A. Asymptotic solution of the Turán problem for some hypergraphs. Graphs and Combinatorics 8, 199–201 (1992). https://doi.org/10.1007/BF02350635
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02350635