On asymptotic local Turán problems

DOI10.2140/MOSCOW.2023.12.273zbMATH Open1530.05135arXiv2303.00375MaRDI QIDQ6188079FDOQ6188079

Authors: Peter Frankl, Jiaxi Nie 

Publication date: 11 January 2024

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

Abstract: An $r$-uniform hypergraph has $(q,p)$-property if any set of $q$ vertices spans a complete sub-hypergraph on $p$ vertices. Let $t_r(n,q,p)$ be the minimum edge density of an $n$-vertex $r$-uniform hypergraph with {em $(q,p)$-property} and let $t_r(q,p)=li{m}_{noinfty}{t}_r(n,q,p)$. A disjoint union of $k$ complete hypergraphs has $(q,lceilq/kceil)$-property, which gives $t_r((q,lceilq/kceil))le1/k^{r-1}$. The first author, Huang and R"odl showed that these constructions are the best asymptotically, that is, $li{m}_{qoinfty}{t}_r((q,lceilq/kceil))=1/k^{r-1}$. They asked whether it is true for all real number $gammage1$ that $li{m}_{qoinfty}{t}_r((q,lceilq/gammaceil))=1/lfloorgammafloo{r}^{r-1}$. In this paper, we give positive answers to this question for a small range of real numbers, and, on the other hand, provide new constructions that give negative answers for many other ranges.

Full work available at URL: https://arxiv.org/abs/2303.00375

Recommendations

• On local Turán problems
• scientific article
• Turán numbers of \(r\)-graphs on \(r + 1\) vertices
• On the Turán density of uniform hypergraphs
• On Ramsey - Turan type theorems for hypergraphs

zbMATH Keywords

extremal combinatoricshypergraphTurán problem

Mathematics Subject Classification ID

Hypergraphs (05C65)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Local Turan property for k-graphs
• Title not available (Why is that?)
• On local Turán problems

This page was built for publication: On asymptotic local Turán problems

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