| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8901184 | Applied Mathematics and Computation | 2018 | 6 Pages |
Abstract
In this paper, we investigate the maximal size of a k-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 a k-uniform hypergraph containing no single tight path.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Ran Gu, Rui Li,