Connected hypergraphs without long Berge-paths

DOI10.1016/J.EJC.2021.103353zbMATH Open1466.05150arXiv1910.01322OpenAlexW3160719424MaRDI QIDQ2033897FDOQ2033897

Authors: Nika Salia, Oscar Zamora, Ervin Győri 

Publication date: 18 June 2021

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

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$.

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

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\)

zbMATH Keywords

hyperedges\(k\)-Berge-path

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• Pósa-type results for Berge hypergraphs
• A Dirac-type theorem for uniform hypergraphs
• On the maximum size of connected hypergraphs without a path of given length
• 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)