Nondegenerate Tur\'{a}n problems under $(t,p)$-norms
Abstract
Given integers and a real number , the -norm of an -graph is the sum of the -th power of the degrees over all -subsets . We conduct a systematic study of the Tur\'{a}n-type problem of determining , which is the maximum of over all -vertex -free -graphs . We establish several basic properties for the -norm of -graphs, enabling us to derive general theorems from the recently established framework in~\cite{CL24} that are useful for determining and proving the corresponding stability. We determine the asymptotic value of for all feasible combinations of and for every graph with chromatic number greater than , where represents the expansion of . In the case where is edge-critical and , we establish strong stability and determine the exact value of for all sufficiently large . These results extend the seminal theorems of Erd\H{o}s--Stone--Simonovits, Andr\'{a}sfai--Erd\H{o}s--S\'{o}s, Erd\H{o}s--Simonovits, and a classical theorem of Mubayi. For the -uniform generalized triangle , we determine the exact value of for all and its asymptotic value for all . This extends old theorems of Bollob\'{a}s, Frankl--F\"{u}redi, and a recent result of Balogh--Clemen--Lidick\'{y}. Our proofs utilize results on the graph inducibility problem, Steiner triple systems, and the feasible region problem introduced by Liu--Mubayi.
Keywords
Cite
@article{arxiv.2406.15934,
title = {Nondegenerate Tur\'{a}n problems under $(t,p)$-norms},
author = {Wanfang Chen and Daniel Iľkovič and Jared León and Xizhi Liu and Oleg Pikhurko},
journal= {arXiv preprint arXiv:2406.15934},
year = {2024}
}
Comments
comments are welcome