Hypergraph extensions of the Erdős-Gallai Theorem
We extend the Erdős-Gallai Theorem 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.
Saved in:
| Published in | European journal of combinatorics Vol. 58; no. C; pp. 238 - 246 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
United Kingdom
Elsevier Ltd
01.11.2016
Elsevier |
| Online Access | Get full text |
| ISSN | 0195-6698 1095-9971 |
| DOI | 10.1016/j.ejc.2016.05.012 |
Cover
Loading…
| Summary: | We extend the Erdős-Gallai Theorem 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. |
|---|---|
| Bibliography: | USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR) AC52-06NA25396 |
| ISSN: | 0195-6698 1095-9971 |
| DOI: | 10.1016/j.ejc.2016.05.012 |