Minimum degree of 3-graphs without long linear paths

DOI10.1016/J.DISC.2020.111949zbMath1443.05135arXiv1903.04162OpenAlexW3026569955MaRDI QIDQ776262

Yue Ma, Jun Gao, Xin Min Hou

Publication date: 8 July 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphminimum degreelinear path

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Paths and cycles (05C38) Vertex degrees (05C07)

Related Items (1)

Berge cycles in non-uniform hypergraphs

Cites Work

• Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
• Turán problems and shadows. I: Paths and cycles
• Tight cycles and regular slices in dense hypergraphs
• Hypergraph extensions of the Erdős-Gallai theorem
• Connected graphs without long paths
• An Erdős-Gallai type theorem for uniform hypergraphs
• Path Ramsey numbers in multicolorings
• Turán Numbers for Forests of Paths in Hypergraphs
• On maximal paths and circuits of graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Minimum degree of 3-graphs without long linear paths