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

DOI10.1016/j.jctb.2024.11.003MaRDI QIDQ6661601

Ervin Győri, Nika Salia

Publication date: 13 January 2025

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

zbMATH Keywords

linear hypergraphTurán numberBerge path

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability in the Erdős-Gallai theorems on cycles and paths
• On the maximum size of connected hypergraphs without a path of given length
• Hypergraph extensions of the Erdős-Gallai theorem
• Connected graphs without long paths
• An Erdős-Gallai type theorem for uniform hypergraphs
• Stability in the Erdős-Gallai theorem on cycles and paths. II
• Even cycles in hypergraphs
• The structure of hypergraphs without long Berge cycles
• Connected hypergraphs without long Berge-paths
• Linear Turán numbers of acyclic triple systems
• Avoiding long Berge cycles
• On 2-connected hypergraphs with no long cycles
• Stability of extremal connected hypergraphs avoiding Berge-paths

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