3-uniform linear hypergraphs without a long Berge path (extended abstract)

DOI10.5817/CZ.MUNI.EUROCOMB23-074MaRDI QIDQ6997052zbMATH OpenFDO

Authors Ervin Győri, Nika Salia

Publication date 15 April 2025

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-074

zbMATH Keywords

Berge pathErdős-Gallai theoremlinear hypergraphnumber of hyperedgesTurán number

Mathematics Subject Classification ID

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

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
• scientific article; zbMATH DE number 3652374 (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 \(r\)-uniform hypergraphs with circumference less than \(r\)
• 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
• The structure of hypergraphs without long Berge cycles

This page was built for publication: 3-uniform linear hypergraphs without a long Berge path (extended abstract)

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