On the maximum size of connected hypergraphs without a path of given length
Combinatorics
2017-10-24 v1
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
Cite
@article{arxiv.1710.08364,
title = {On the maximum size of connected hypergraphs without a path of given length},
author = {Ervin Győri and Abhishek Methuku and Nika Salia and Casey Tompkins and Máté Vizer},
journal= {arXiv preprint arXiv:1710.08364},
year = {2017}
}