Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 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

Turan numbers of extensions of some sparse hypergraphs via Lagrangians (1609.08983v1)

Published 28 Sep 2016 in math.CO

Abstract: Given a positive integer $n$ and an $r$-uniform hypergraph (or $r$-graph for short) $F$, the Turan number $ex(n,F)$ of $F$ is the maximum number of edges in an $r$-graph on $n$ vertices that does not contain $F$ as a subgraph. The extension $HF $ of $F$ is obtained as follows: For each pair of vertices $v_i,v_j$ in $F$ not contained in an edge of $F$, we add a set $B_{ij}$ of $r-2$ new vertices and the edge ${v_i,v_j} \cup B_{ij}$, where the $B_{ij}$ 's are pairwise disjoint over all such pairs ${i,j}$. Let $Kr_p$ denote the complete $r$-graph on $p$ vertices. For all sufficiently large $n$, we determine the Turan numbers of the extensions of a $3$-uniform $t$-matching, a $3$-uniform linear star of size $t$, and a $4$-uniform linear star of size $t$, respectively. We also show that the unique extremal hypergraphs are balanced blowups of $K3_{3t-1}, K3_{2t}$, and $K4_{3t}$, respectively. Our results generalize the recent result of Hefetz and Keevash [7].

Summary

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