| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653227 | European Journal of Combinatorics | 2016 | 9 Pages |
Abstract
We extend the Erdős-Gallai Theorem for Berge paths in rr-uniform hypergraphs. We also find the extremal hypergraphs avoiding tt-tight paths of a given length and consider this extremal problem for other definitions of paths in hypergraphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ervin Győri, Gyula Y. Katona, Nathan Lemons,