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.

[1]  Gyula Y. Katona,et al.  Hypergraph Extensions of the Erdos-Gallai Theorem , 2010, Electron. Notes Discret. Math..

[2]  Dániel Gerbner,et al.  Extremal Results for Berge Hypergraphs , 2015, SIAM J. Discret. Math..

[3]  P. Erdgs,et al.  ON MAXIMAL PATHS AND CIRCUITS OF GRAPHS , 2002 .

[4]  Daniela Kühn,et al.  Hamilton l-cycles in uniform hypergraphs , 2009, J. Comb. Theory, Ser. A.

[5]  Gyula Y. Katona,et al.  Generating quadrangulations of surfaces with minimum degree at least 3 , 1999 .

[6]  Vojtech Rödl,et al.  On a Packing and Covering Problem , 1985, Eur. J. Comb..

[7]  Zsolt Tuza.  Steiner systems and large non-Hamiltonian hypergraphs , 2006 .

[8]  Zoltán Füredi.  Linear paths and trees in uniform hypergraphs , 2011, Electron. Notes Discret. Math..

[9]  Sylvain Gravier,et al.  Monochromatic Hamiltonian t-tight Berge-cycles in hypergraphs , 2008, J. Graph Theory.

[10]  Jacques Verstraëte,et al.  Minimal paths and cycles in set systems , 2007, Eur. J. Comb..

[11]  Balazs Patkos,et al.  A note on traces of set families , 2011, 1111.4636.

[12]  Vojtech Rödl,et al.  An approximate Dirac-type theorem for k-uniform hypergraphs , 2008, Comb..

[13]  Yury Person,et al.  On extremal hypergraphs for Hamiltonian cycles , 2011, Eur. J. Comb..

[14]  Peter Frankl,et al.  Extremal k-edge-hamiltonian Hypergraphs , 2001, Electron. Notes Discret. Math..

[15]  Zoltán Füredi,et al.  Exact solution of some Turán-type problems , 1987, J. Comb. Theory, Ser. A.

[16]  Peter Allen,et al.  Tight cycles and regular slices in dense hypergraphs , 2014, J. Comb. Theory, Ser. A.