当前位置:
X-MOL 学术
›
J. Comb. Theory A
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Hypergraphs without exponents
Journal of Combinatorial Theory Series A ( IF 0.9 ) Pub Date : 2021-07-29 , DOI: 10.1016/j.jcta.2021.105517 Zoltán Füredi 1 , Dániel Gerbner 1
中文翻译:
没有指数的超图
更新日期:2021-07-30
Journal of Combinatorial Theory Series A ( IF 0.9 ) Pub Date : 2021-07-29 , DOI: 10.1016/j.jcta.2021.105517 Zoltán Füredi 1 , Dániel Gerbner 1
Affiliation
A short, concise proof is given for that for there exists a k-uniform hypergraph H without exponent, i.e., when the Turán function is not polynomial in n. More precisely, we have but it exceeds for any positive c for . We conjecture that this is true for as well.
中文翻译:
没有指数的超图
对此给出了一个简短的证明,因为 存在一个没有指数的k均匀超图H,即当 Turán 函数在n 中不是多项式时。更准确地说,我们有 但它超过 对于任何正c对于. 我们推测这是真的 以及。