On extremal hypergraphs for forests of tight paths

DOI10.1016/J.AMC.2017.12.036zbMATH Open1428.05151OpenAlexW2783511017MaRDI QIDQ2279249FDOQ2279249

Authors: Ran Gu, Rui Li 

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

Recommendations

• Hypergraph extensions of the Erdős-Gallai theorem
• Hypergraph extensions of the Erdős-Gallai theorem
• An Erdős-Gallai type theorem for uniform hypergraphs
• Turán numbers for forests of paths in hypergraphs
• Tight paths in convex geometric hypergraphs

zbMATH Keywords

pathshypergraphsextremalhyperpaths

Mathematics Subject Classification ID

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

Cites Work

• On maximal paths and circuits of graphs
• On a packing and covering problem
• Title not available (Why is that?)
• Counting designs
• Hamiltonian chains in hypergraphs
• Turán numbers for forests of paths in hypergraphs
• Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
• Turán problems and shadows. I: Paths and cycles
• Hypergraph extensions of the Erdős-Gallai theorem
• Degree powers in \(C_5\)-free graphs
• Minimal paths and cycles in set systems
• Hypergraph Turán numbers of linear cycles
• Turán numbers of multiple paths and equibipartite forests
• On the Turán number of forests
• Turán numbers for disjoint copies of graphs
• The Turán number of the graph \(3P_4\)
• The Turán number of the graph \(2P_5\)
• Non-jumping numbers for 5-uniform hypergraphs
• The Turán number of disjoint copies of paths

Cited In (4)

• Hypergraph extensions of the Erdős-Gallai theorem
• Hypergraph extensions of the Erdős-Gallai theorem
• Hypergraphs not containing a tight tree with a bounded trunk
• Hypergraphs not containing a tight tree with a bounded trunk. II: 3-trees with a trunk of size 2

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

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