On extremal hypergraphs for forests of tight paths

DOI10.1016/j.amc.2017.12.036zbMath1428.05151OpenAlexW2783511017MaRDI QIDQ2279249

Rui Li, Ran Gu

Publication date: 12 December 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2017.12.036

zbMATH Keywords

pathshypergraphsextremalhyperpaths

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On the Turán number of forests
• Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
• Turán problems and shadows. I: Paths and cycles
• Turán numbers for disjoint copies of graphs
• The Turán number of the graph \(2P_5\)
• Hypergraph extensions of the Erdős-Gallai theorem
• Degree powers in \(C_5\)-free graphs
• On a packing and covering problem
• Counting designs
• Minimal paths and cycles in set systems
• The Turán number of disjoint copies of paths
• Non-jumping numbers for 5-uniform hypergraphs
• Hypergraph Turán numbers of linear cycles
• Turán Numbers of Multiple Paths and Equibipartite Forests
• Turán Numbers for Forests of Paths in Hypergraphs
• On maximal paths and circuits of graphs
• Hamiltonian chains in hypergraphs
• The Turàn number of the graph 3P4

This page was built for publication: On extremal hypergraphs for forests of tight paths