Negligible Obstructions and Turán Exponents  

作　　者：Tao Jiang Zilin Jiang Jie Ma 

机构地区：[1]Department of Mathematics,Miami Univeristy,Oaford,OH 45056,USA [2]School of Mathematical and Statistical Sciences,and School of Computing and Augmented Intelligence,Arizona State University,Tempe,AZ 85281,USA [3]School of Mathematical Sciences,University of Science and Technology of China,Hefei,Anhui 230026,China

出　　处：《Annals of Applied Mathematics》2022年第3期356-384,共29页应用数学年刊（英文版）

基　　金：supported in part by U.S.taxpayers through the National Science Foundation(NSF)grant DMS-1855542;by U.S.taxpayers through NSF grant DMS-1953946;supported in part by an AMS Simons Travel Grant;supported in part by the National Key R&D Program of China 2020YFA0713100;National Natural Science Foundation of China grants 11622110 and 12125106;Anhui Initiative in Quantum Information Technologies grant AHY150200。

摘　　要：We show that for every rational number r∈(1,2)of the form 2-a/b,where a,b∈N^(+)satisfy[b/a]^(3)≤a≤b/([b/a]+1)+1,there exists a graph Frsuch that the Turán number ex(n,F_(r))=Θ(n^(r)).Our result in particular generates infinitely many new Turán exponents.As a byproduct,we formulate a framework that is taking shape in recent work on the Bukh–Conlon conjecture.

关 键 词：Extremal graph theory turán exponents bipartite graphs 

分 类 号：O157.5[理学—数学]