Linear three-uniform hypergraphs with no Berge path of given length

DOI10.1016/J.JCTB.2024.11.003MaRDI QIDQ6661601zbMATH OpenFDO

Authors Ervin Győri, Nika Salia

Publication date 13 January 2025

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTB.2024.11.003

zbMATH Keywords

Berge pathlinear hypergraphTurán number

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Hypergraphs (05C65)

Recommendations

• Hypergraph extensions of the Erdős-Gallai theorem
• An Erdős-Gallai type theorem for uniform hypergraphs
• Hypergraph extensions of the Erdős-Gallai theorem
• On extremal hypergraphs for forests of tight paths

Cites work

• An Erdős-Gallai type theorem for uniform hypergraphs
• Avoiding long Berge cycles
• Connected graphs without long paths
• Connected hypergraphs without long Berge-paths
• Even cycles in hypergraphs
• scientific article; zbMATH DE number 3652374 (Why is no real title available?)
• scientific article; zbMATH DE number 5174567 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• Hypergraph extensions of the Erdős-Gallai theorem
• Linear Turán numbers of acyclic triple systems
• On 2-connected hypergraphs with no long cycles
• On the maximum size of connected hypergraphs without a path of given length
• Stability in the Erdős-Gallai theorem on cycles and paths. II
• Stability in the Erdős-Gallai theorems on cycles and paths
• Stability of extremal connected hypergraphs avoiding Berge-paths
• The structure of hypergraphs without long Berge cycles

Cited in

(1)

• Localized version of hypergraph Erdős-Gallai theorem

This page was built for publication: Linear three-uniform hypergraphs with no Berge path of given length

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