| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652787 | Electronic Notes in Discrete Mathematics | 2010 | 8 Pages |
Abstract
The Erdős-Gallai Theorem gives the maximum number of edges in a graph without a path of length k. We extend this result for Berge paths in r-uniform hypergraphs. We also find the extremal hypergraphs avoiding t-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
