A Dirac-type theorem for uniform hypergraphs

DOI10.1007/s00373-024-02802-8zbMath1544.05072MaRDI QIDQ6580493

Xin Min Hou, Yue Ma, Jun Gao

Publication date: 29 July 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

hypergraphminimum degreeDirac theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Connectivity (05C40) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs
• On the maximum size of connected hypergraphs without a path of given length
• Hypergraph extensions of the Erdős-Gallai theorem
• Berge cycles in non-uniform hypergraphs
• Connected graphs without long paths
• The maximum number of cliques in graphs without long cycles
• An Erdős-Gallai type theorem for uniform hypergraphs
• Connected hypergraphs without long Berge-paths
• Avoiding long Berge cycles. II: Exact bounds for all \(n\)
• A Dirac-type theorem for Berge cycles in random hypergraphs
• Avoiding long Berge cycles
• On 2-connected hypergraphs with no long cycles
• Recent advances on Dirac-type problems for hypergraphs
• On maximal paths and circuits of graphs
• Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2
• A Rainbow Dirac's Theorem
• Some Theorems on Abstract Graphs
• Stability of extremal connected hypergraphs avoiding Berge-paths

This page was built for publication: A Dirac-type theorem for uniform hypergraphs