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
期刊:
Journal of Combinatorial Theory, Series A
影响因子:
--
通讯作者:
Ergemlidze B
Ergemlidze B
中科院分区:
--
文献类型:
--
作者:
Ergemlidze B

文献摘要

参考文献

相似文献

设t是一个整数,使得t≥ 2。设K2,t(3)表示由2 t个三元组{a,xi,yi},{B,xi,yi}(1≤ i≤ t)组成的三元系,其中元素a,B,x1,x2,.,xi,y1,y2,.,yi都是不同的.设ex(n,K2,t(3))表示不含K2,t(3)的n元三元系的最大尺寸.这个函数由Mubayi和Verstraëte [9]研究,其中特殊情况t= 2是Erdés [1]的问题,由不同的作者[3],[9],[10]研究。Mubayi和Verstraëte证明了ex(n,K 2,t(3))< t 4(n 2),并且对于无穷多个n,ex(n,K 2,t(3))≥ 2 t− 1 3(n 2)。这些界与标准论证一起表明g(t):= lim n→∞ <$ex(n,K 2,t(3))/(n 2)存在且2 t− 1 3≤ g(t)≤ t 4。解决了Mubayi和Verstraëte关于g(t)的增长率的问题,证明了当t→∞时,g(t)= Θ(t1 + o(1)).
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)).
所有不相交对都有不同并集的超图
DOI: 10.1007/bf02579216
发表时间: 1984
期刊: Combinatorica
影响因子: 1.1
作者:
Z. Füredi
通讯作者: Z. Füredi
无广义 4 循环的超图的最大尺寸
DOI: 10.1016/j.jcta.2008.09.002
发表时间: 2009
期刊: J. Comb. Theory A
影响因子: --
作者:
O. Pikhurko;Jacques Verstraëte
通讯作者: Jacques Verstraëte