On extremal hypergraphs for forests of tight paths
On extremal hypergraphs for forests of tight paths
复制标题
关于紧路径森林的极值超图
DOI：
10.1016/j.amc.2017.12.036
复制
发表时间：
2018
影响因子：
4
通讯作者：
Li Rui
中科院分区：
文献类型：
--
作者：
Gu Ran;Li Rui
本文研究了不包含紧路径森林的ak-均匀超图的最大尺寸，推广了图中路径的经典Erdős-Gallai定理。我们的结果建立在Györi， Katona和Lemons的结果之上，他们考虑了不包含单一紧路径的ak-均匀超图的最大大小。
In this paper, we investigate the maximal size of ak-uniform hypergraph containing no forests of tight paths, which extends the classical Erdős–Gallai Theorem for paths in graphs. Our results build on the results of Györi, Katona and Lemons, who considered the maximal size of ak-uniform hypergraph containing no single tight path.