On the maximum size of connected hypergraphs without a path of given length |
| |
| Authors: | Ervin Győri Abhishek Methuku Nika Salia Casey Tompkins Máté Vizer |
| |
| Affiliation: | 1. Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, Hungary;2. Central European University, Budapest, Hungary |
| |
| Abstract: | In this note we asymptotically determine the maximum number of hyperedges possible in an -uniform, connected -vertex hypergraph without a Berge path of length , as and tend to infinity. We show that, unlike in the graph case, the multiplicative constant is smaller with the assumption of connectivity. |
| |
| Keywords: | Connected Erd?s–Gallai Berge hypergraph |
| 本文献已被 ScienceDirect 等数据库收录！ |
