Asymptotic solution of a turán-type problem
Asymptotic solution of a turán-type problem
复制标题
图兰型问题的渐近解
DOI：
--
复制
发表时间：
1990
期刊：
影响因子：
--
通讯作者：
P. Frankl
中科院分区：
文献类型：
--
作者：
P. Frankl
AbstractLetA, 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} + Oleft( {frac{1}{n}}
ight)}
ight)left( {egin{array}{*{20}c} n \ {2k} \ end{array} }
ight)$$
edges. Moreover, this is essentially best possible.
AbstractLetA, 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} + Oleft( {frac{1}{n}}
ight)}
ight)left( {egin{array}{*{20}c} n \ {2k} \ end{array} }
ight)$$
edges. Moreover, this is essentially best possible.