Title of article
Hypergraph Extensions of the Erdős-Gallai Theorem
Author/Authors
I. Gyori، نويسنده , , Ervin and Katona، نويسنده , , Gyula Y. and Lemons، نويسنده , , Nathan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
8
From page
655
To page
662
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.
Keywords
Berge path , Hypergraph , Extremal graph
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2010
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455482
Link To Document