Hypergraph Extensions of the Erdős-Gallai Theorem

DOI10.1016/J.ENDM.2010.05.083zbMath1236.05138OpenAlexW2074250824MaRDI QIDQ2883632

Nathan Lemons, Gyula Y. Katona, Ervin Gyoeri

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/39360/1/gklrevised.pdf

zbMATH Keywords

hypergraphextremal graphBerge path

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Paths and cycles (05C38)

Related Items (14)

Extension of paths and cycles for hypergraphs ⋮ On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\) ⋮ Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths ⋮ On extremal hypergraphs for Hamiltonian cycles ⋮ Hypergraph Turán numbers of linear cycles ⋮ Turán problems and shadows. I: Paths and cycles ⋮ The Turán Number of Berge K_4 in Triple Systems ⋮ On the cover Turán number of Berge hypergraphs ⋮ Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs ⋮ Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs ⋮ On Hamiltonian Berge cycles in [3-uniform hypergraphs] ⋮ Linear trees in uniform hypergraphs ⋮ Hypergraph extensions of the Erdős-Gallai theorem ⋮ Hypergraph Turán numbers of vertex disjoint cycles

Cites Work

• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• On a packing and covering problem
• Extremal \(k\)-edge-Hamiltonian hypergraphs
• On maximal paths and circuits of graphs
• Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs
• Hamiltonian chains in hypergraphs

This page was built for publication: Hypergraph Extensions of the Erdős-Gallai Theorem