Connected hypergraphs without long Berge-paths

DOI10.1016/J.EJC.2021.103353MaRDI QIDQ2033897zbMATH OpenOpenAlexFDO

Authors Nika Salia, Oscar Zamora, Ervin Győri

Publication date 18 June 2021

Published in European Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://arxiv.org/abs/1910.01322

zbMATH Keywords

hyperedges\(k\)-Berge-path

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Hypergraphs (05C65)

Abstract: We generalize a result of Balister, Gy{H{o}}ri, Lehel and Schelp for hypergraphs. We determine the unique extremal structure of an $n$-vertex, $r$-uniform, connected, hypergraph with the maximum number of hyperedges, without a $k$-Berge-path, where $ngeq{N}_{k,r}$, $kgeq2r+13>17$.

Recommendations

• On the maximum size of connected hypergraphs without a path of given length
• The structure of hypergraphs without long Berge cycles
• Hypergraphs with Few Berge Paths of Fixed Length between Vertices
• On 2-connected hypergraphs with no long cycles
• On \(r\)-uniform hypergraphs with circumference less than \(r\)

Cites work

• scientific article; zbMATH DE number 3652374 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• An Erdős-Gallai type theorem for uniform hypergraphs
• Avoiding long Berge cycles
• Connected graphs without long paths
• General lemmas for Berge-Turán hypergraph problems
• Hypergraph extensions of the Erdős-Gallai theorem
• On 2-connected hypergraphs with no long cycles
• On \(r\)-uniform hypergraphs with circumference less than \(r\)
• On maximal paths and circuits of graphs
• On the maximum size of connected hypergraphs without a path of given length
• Path Ramsey numbers in multicolorings
• The structure of hypergraphs without long Berge cycles

Cited in

(10)

• Pósa-type results for Berge hypergraphs
• A Dirac-type theorem for uniform hypergraphs
• 3-uniform linear hypergraphs without a long Berge path (extended abstract)
• On the maximum size of connected hypergraphs without a path of given length
• A hypergraph analog of Dirac's theorem for long cycles in 2-connected graphs. II: Large uniformities
• Hypergraph extensions of the Erdős-Gallai theorem
• Stability of extremal connected hypergraphs avoiding Berge-paths
• Hypergraphs with Few Berge Paths of Fixed Length between Vertices
• Linear three-uniform hypergraphs with no Berge path of given length
• The structure of hypergraphs without long Berge cycles

This page was built for publication: Connected hypergraphs without long Berge-paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2033897)