New bounds for a hypergraph bipartite Turán problem
New bounds for a hypergraph bipartite Turán problem
复制标题
超图二分图兰问题的新界限
DOI:
10.1016/j.jcta.2020.105299
复制
发表时间:
2020
期刊:
影响因子:
--
通讯作者:
Ergemlidze B
中科院分区:
文献类型:
--
作者:
Ergemlidze B
Let t be an integer such that t≥ 2. Let K 2, t (3) denote the triple system consisting of the 2t triples {a, x i, y i},{b, x i, y i} for 1≤ i≤ t, where the elements a, b, x 1, x 2,…, x t, y 1, y 2,…, y t are all distinct. Let ex (n, K 2, t (3)) denote the maximum size of a triple system on n elements that does not contain K 2, t (3). This function was studied by Mubayi and Verstraëte [9], where the special case t= 2 was a problem of Erdős [1] that was studied by various authors [3],[9],[10]. Mubayi and Verstraëte proved that ex (n, K 2, t (3))< t 4 (n 2) and that for infinitely many n, ex (n, K 2, t (3))≥ 2 t− 1 3 (n 2). These bounds together with a standard argument show that g (t):= lim n→∞ ex (n, K 2, t (3))/(n 2) exists and that 2 t− 1 3≤ g (t)≤ t 4. Addressing the question of Mubayi and Verstraëte on the growth rate of g (t), we prove that as t→∞, g (t)= Θ (t 1+ o (1)).
影响因子:
1.1
作者:
Z. Füredi
通讯作者:
Z. Füredi
DOI:
10.1016/j.jcta.2008.09.002
发表时间:
2009
期刊:
J. Comb. Theory A
影响因子:
--
作者:
O. Pikhurko;Jacques Verstraëte
通讯作者:
Jacques Verstraëte