当前位置:
X-MOL 学术
›
Eur. J. Comb.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Connected hypergraphs without long Berge-paths
European Journal of Combinatorics ( IF 1 ) Pub Date : 2021-05-07 , DOI: 10.1016/j.ejc.2021.103353 Ervin Győri , Nika Salia , Oscar Zamora
中文翻译:
没有长Berge路径的连通超图
更新日期:2021-05-08
European Journal of Combinatorics ( IF 1 ) Pub Date : 2021-05-07 , DOI: 10.1016/j.ejc.2021.103353 Ervin Győri , Nika Salia , Oscar Zamora
We generalize a result of Balister, Győri, Lehel and Schelp for hypergraphs. We determine the unique extremal structure of an -vertex -uniform connected hypergraph with the maximum number of hyperedges, without a -Berge-path, where , .
中文翻译:
没有长Berge路径的连通超图
我们将Balister,Győri,Lehel和Schelp的结果推广为超图。我们确定了一个独特的极端结构-顶点 -具有最大超边数的均匀连接超图,而没有 -合并路径,在哪里 , 。