可忽略障碍与Turán指数

T. Jiang, Zilin Jiang, Jie Ma
{"title":"可忽略障碍与Turán指数","authors":"T. Jiang, Zilin Jiang, Jie Ma","doi":"10.4208/aam.OA-2022-0008","DOIUrl":null,"url":null,"abstract":"We show that for every rational number $r \\in (1,2)$ of the form $2 - a/b$, where $a, b \\in \\mathbb{N}^+$ satisfy $\\lfloor a/b \\rfloor^3 \\le a \\le b / (\\lfloor b/a \\rfloor +1) + 1$, there exists a graph $F_r$ such that the Turan number $\\operatorname{ex}(n, F_r) = \\Theta(n^r)$. Our result in particular generates infinitely many new Turan exponents. As a byproduct, we formulate a framework that is taking shape in recent work on the Bukh--Conlon conjecture.","PeriodicalId":58853,"journal":{"name":"应用数学年刊:英文版","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Negligible Obstructions and Turán Exponents\",\"authors\":\"T. Jiang, Zilin Jiang, Jie Ma\",\"doi\":\"10.4208/aam.OA-2022-0008\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that for every rational number $r \\\\in (1,2)$ of the form $2 - a/b$, where $a, b \\\\in \\\\mathbb{N}^+$ satisfy $\\\\lfloor a/b \\\\rfloor^3 \\\\le a \\\\le b / (\\\\lfloor b/a \\\\rfloor +1) + 1$, there exists a graph $F_r$ such that the Turan number $\\\\operatorname{ex}(n, F_r) = \\\\Theta(n^r)$. Our result in particular generates infinitely many new Turan exponents. As a byproduct, we formulate a framework that is taking shape in recent work on the Bukh--Conlon conjecture.\",\"PeriodicalId\":58853,\"journal\":{\"name\":\"应用数学年刊:英文版\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"应用数学年刊:英文版\",\"FirstCategoryId\":\"1089\",\"ListUrlMain\":\"https://doi.org/10.4208/aam.OA-2022-0008\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"应用数学年刊:英文版","FirstCategoryId":"1089","ListUrlMain":"https://doi.org/10.4208/aam.OA-2022-0008","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

我们证明,对于形式为$2 - a/b$的每个有理数$r \in (1,2)$,其中$a, b \in \mathbb{N}^+$满足$\lfloor a/b \rfloor^3 \le a \le b / (\lfloor b/a \rfloor +1) + 1$,存在一个图$F_r$,使得图兰数$\operatorname{ex}(n, F_r) = \Theta(n^r)$。我们的结果产生了无穷多个新的图兰指数。作为副产品,我们在最近的Bukh- Conlon猜想工作中形成了一个框架。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Negligible Obstructions and Turán Exponents
We show that for every rational number $r \in (1,2)$ of the form $2 - a/b$, where $a, b \in \mathbb{N}^+$ satisfy $\lfloor a/b \rfloor^3 \le a \le b / (\lfloor b/a \rfloor +1) + 1$, there exists a graph $F_r$ such that the Turan number $\operatorname{ex}(n, F_r) = \Theta(n^r)$. Our result in particular generates infinitely many new Turan exponents. As a byproduct, we formulate a framework that is taking shape in recent work on the Bukh--Conlon conjecture.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
544
期刊最新文献
Error Analysis of the Nonconforming $P_1$ Finite Element Method to the Sequential Regularization Formulation for Unsteady Navier-Stokes Equations Fast High Order and Energy Dissipative Schemes with Variable Time Steps for Time-Fractional Molecular Beam Epitaxial Growth Model A New Locking-Free Virtual Element Method for Linear Elasticity Problems A Linearized Adaptive Dynamic Diffusion Finite Element Method for Convection-Diffusion-Reaction Equations Improved Analysis of PINNs: Alleviate the CoD for Compositional Solutions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1