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:
Bibliographic Details
Published in:European journal of combinatorics 2016-11, Vol.58 (C), p.238-246
Main Authors: Győri, Ervin, Katona, Gyula Y., Lemons, Nathan
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
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.
ISSN:0195-6698
1095-9971
DOI:10.1016/j.ejc.2016.05.012