The maximal length of a gap between r-graph Tur\'an densities
classification
🧮 math.CO
keywords
densitydensitieslengthopenarxivavoidingconjecturee-print
pith:YRJLZTDL Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{YRJLZTDL}
Prints a linked pith:YRJLZTDL badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
The Tur\'an density $\pi(\cal F)$ of a family $\cal F$ of $r$-graphs is the limit as $n\to\infty$ of the maximum edge density of an $\cal F$-free $r$-graph on $n$ vertices. Erdos [Israel J. Math 2 (1964) 183--190] proved that no Tur\'an density can lie in the open interval $(0,r!/r^r)$. Here we show that any other open subinterval of $[0,1]$ avoiding Tur\'an densities has strictly smaller length. In particular, this implies a conjecture of Grosu [E-print arXiv:1403.4653v1, 2014].
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.