Turán Numbers for Forests of Paths in Hypergraphs

DOI10.1137/130913833zbMath1301.05184arXiv1303.5022OpenAlexW1980445241MaRDI QIDQ3192159

Neal Bushaw, Nathan Kettle

Publication date: 26 September 2014

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

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

zbMATH Keywords

pathshypergraphsTurán numberhyperpaths

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05)

Related Items (7)

Turán numbers for hypergraph star forests ⋮ Turán numbers for 3-uniform linear paths of length 3 ⋮ The Turán number of disjoint copies of paths ⋮ Turán numbers for disjoint paths ⋮ On extremal hypergraphs for forests of tight paths ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ Minimum degree of 3-graphs without long linear paths

This page was built for publication: Turán Numbers for Forests of Paths in Hypergraphs