当前位置: X-MOL 学术J. Comb. Theory B › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
The structure of hypergraphs without long Berge cycles
Journal of Combinatorial Theory Series B ( IF 1.2 ) Pub Date : 2020-05-05 , DOI: 10.1016/j.jctb.2020.04.007
Ervin Győri , Nathan Lemons , Nika Salia , Oscar Zamora

We study the structure of r-uniform hypergraphs containing no Berge cycles of length at least k for kr, and determine that such hypergraphs have some special substructure. In particular we determine the extremal number of such hypergraphs, giving an affirmative answer to the conjectured value when k=r and giving a simple solution to a recent result of Kostochka-Luo when k<r.



中文翻译:

没有较长Berge周期的超图的结构

我们研究的结构- [R至少含有长度的无Berge的周期-uniform超图ķķ[R,并确定此类超图具有某些特殊的子结构。特别是,我们确定了此类超图的极值,从而在以下情况下对猜想值给出肯定的答案ķ=[R 并给出了对Kostochka-Luo最近的结果的简单解决方案 ķ<[R

更新日期:2020-05-05
down
wechat
bug