Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
121 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Turán Numbers for Forests of Paths in Hypergraphs (1303.5022v4)

Published 20 Mar 2013 in math.CO

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_lr 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_lr, and P'_lr denote an r-uniform linear path on l edges. We determine precisely ex_r(n;F(k,l)) and ex_r(n;k*P'_lr), 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.

Summary

We haven't generated a summary for this paper yet.