Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 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

Codegree Turán density of complete $r$-uniform hypergraphs (1801.01393v2)

Published 4 Jan 2018 in math.CO

Abstract: Let $r\ge 3$. Given an $r$-graph $H$, the minimum codegree $\delta_{r-1}(H)$ is the largest integer $t$ such that every $(r-1)$-subset of $V(H)$ is contained in at least $t$ edges of $H$. Given an $r$-graph $F$, the codegree Tur\'an density $\gamma(F)$ is the smallest $\gamma >0$ such that every $r$-graph on $n$ vertices with $\delta_{r-1}(H)\ge (\gamma + o(1))n$ contains $F$ as a subhypergraph. Using results on the independence number of hypergraphs, we show that there are constants $c_1, c_2>0$ depending only on $r$ such that [ 1 - c_2 \frac{\ln t}{t{r-1}} \le \gamma(K_tr) \le 1 - c_1 \frac{\ln t}{t{r-1}}, ] where $K_tr$ is the complete $r$-graph on $t$ vertices. This gives the best general bounds for $\gamma(K_tr)$.

Summary

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