Turán numbers for forests of paths in hypergraphs

DOI10.1137/130913833MaRDI QIDQ3192159zbMATH OpenOpenAlexFDO

Authors 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, http://hdl.handle.net/2286/R.I.26563

zbMATH Keywords

pathshypergraphshyperpathsTurán number

Mathematics Subject Classification ID

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

Abstract: The Tur'an number of an r-uniform hypergraph H is the maximum number of edges in any r-graph on n vertices which does not contain H as a subgraph. Let P_l^(r) denote the family of r-uniform loose paths on l edges, F(k,l) denote the family of hypergraphs consisting of k disjoint paths from P_l^(r), and P'_l^(r) denote an r-uniform linear path on l edges. We determine precisely ex_r(n;F(k,l)) and ex_r(n;k*P'_l^(r)), as well as the Tur'an numbers for forests of paths of differing lengths (whether these paths are loose or linear) when n is appropriately large dependent on k,l,r, for r>=3. Our results build on recent results of F"uredi, Jiang, and Seiver who determined the extremal numbers for individual paths, and provide more hypergraphs whose Turan numbers are exactly determined.

Recommendations

• On the Turán number of forests
• Hypergraph Turán numbers of vertex disjoint cycles
• Turán numbers of multiple paths and equibipartite forests
• Turán problems and shadows. I: Paths and cycles
• Linear paths and trees in uniform hypergraphs

Cited in

(13)

• Turán numbers for hypergraph star forests
• Turán numbers of multiple paths and equibipartite forests
• The formula for Turán number of spanning linear forests
• Turán numbers for 3-uniform linear paths of length 3
• Turán problems and shadows. I: Paths and cycles
• Turán numbers of general star forests in hypergraphs
• On extremal hypergraphs for forests of tight paths
• Minimum degree of 3-graphs without long linear paths
• The Turán number of disjoint copies of paths
• Turán numbers for disjoint paths
• Turán numbers of ordered tight hyperpaths
• Turán problems and shadows. II: Trees
• Anti-Ramsey numbers of paths and cycles in hypergraphs

This page was built for publication: Turán numbers for forests of paths in hypergraphs

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