Abstract
LetA, B, C be disjointk-element sets. It is shown that if a 2k-graph onn vertices contains no three edges of the formA ∪ B, A ∪ C, B ∪ C then it has at most\(\left( {\frac{1}{2} + O\left( {\frac{1}{n}} \right)} \right)\left( {\begin{array}{*{20}c} n \\ {2k} \\ \end{array} } \right)\) edges. Moreover, this is essentially best possible.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bollobás, B.: Three-graphs without two triples whose symmetric difference is contained in a third. Discrete Math.8, 21–24 (1974)
Caen, D. de: Uniform hypergraphs with no blocks containing the symmetric difference of any two other blocks. Proc. 16-th S-E Conf. Congressus Num.47, 249–253 (1985)
Erdös, P.: On extremal problems on graphs and generalized graphs, Isr. J. Math.2, 183–190 (1964)
Frankl, P., Füredi, Z.: Union-free families of sets and probability theory, Europ. J. Comb. Errata, ibid p. 3955, 127–131 (1984)
Frankl, P., Füredi, Z.: An extremal problem whose solutions are the blow-ups of the small Witt-designs. J. Comb. Theory52, 129–147 (1989)
Frankl, P., Füredi, Z.: A new generalization of the Erdös-Ko-Rado theorem. Combinatorica3, 341–349 (1983)
Katona, G.O.H.: Extremal problems for hypergraphs, in “Combinatorics” Math. Cent. Tracts.56, Vol. II, pp. 13–42 (1974)
Katona, G.O.H., Nemetz, T., Simonovits, M.: On a graph problem of Turán, Mat. Lapok15, 228–238 (1964) (Hungarian, English summary)
Mantel, W.: Problem 28. Wiskundige Opgaven10, 60–61 (1907)
Sidorenko, A.F.: Solution of a problem of Bollobás on 4-graphs. Mat. Zametki41, 433–455 (1987)
Turán, P.: Research problem, Közl. MTA Mat. Kut. Int.6, 417–423 (1961)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Frankl, P. Asymptotic solution of a turán-type problem. Graphs and Combinatorics 6, 223–227 (1990). https://doi.org/10.1007/BF01787573
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01787573