关于膨胀的非退化图兰问题

IF 1 3区 数学 Q1 MATHEMATICS European Journal of Combinatorics Pub Date : 2024-09-23 DOI:10.1016/j.ejc.2024.104071
Dániel Gerbner
{"title":"关于膨胀的非退化图兰问题","authors":"Dániel Gerbner","doi":"10.1016/j.ejc.2024.104071","DOIUrl":null,"url":null,"abstract":"<div><div>The <span><math><mi>r</mi></math></span>-uniform expansion <span><math><msup><mrow><mi>F</mi></mrow><mrow><mrow><mo>(</mo><mi>r</mi><mo>)</mo></mrow><mo>+</mo></mrow></msup></math></span> of a graph <span><math><mi>F</mi></math></span> is obtained by enlarging each edge with <span><math><mrow><mi>r</mi><mo>−</mo><mn>2</mn></mrow></math></span> new vertices such that altogether we use <span><math><mrow><mrow><mo>(</mo><mi>r</mi><mo>−</mo><mn>2</mn><mo>)</mo></mrow><mrow><mo>|</mo><mi>E</mi><mrow><mo>(</mo><mi>F</mi><mo>)</mo></mrow><mo>|</mo></mrow></mrow></math></span> new vertices. Two simple lower bounds on the largest number <span><math><mrow><msub><mrow><mi>ex</mi></mrow><mrow><mi>r</mi></mrow></msub><mrow><mo>(</mo><mi>n</mi><mo>,</mo><msup><mrow><mi>F</mi></mrow><mrow><mrow><mo>(</mo><mi>r</mi><mo>)</mo></mrow><mo>+</mo></mrow></msup><mo>)</mo></mrow></mrow></math></span> of <span><math><mi>r</mi></math></span>-edges in <span><math><msup><mrow><mi>F</mi></mrow><mrow><mrow><mo>(</mo><mi>r</mi><mo>)</mo></mrow><mo>+</mo></mrow></msup></math></span>-free <span><math><mi>r</mi></math></span>-graphs are <span><math><mrow><mi>Ω</mi><mrow><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mi>r</mi><mo>−</mo><mn>1</mn></mrow></msup><mo>)</mo></mrow></mrow></math></span> (in the case <span><math><mi>F</mi></math></span> is not a star) and <span><math><mrow><mi>ex</mi><mrow><mo>(</mo><mi>n</mi><mo>,</mo><msub><mrow><mi>K</mi></mrow><mrow><mi>r</mi></mrow></msub><mo>,</mo><mi>F</mi><mo>)</mo></mrow></mrow></math></span>, which is the largest number of <span><math><mi>r</mi></math></span>-cliques in <span><math><mi>n</mi></math></span>-vertex <span><math><mi>F</mi></math></span>-free graphs. We prove that <span><math><mrow><msub><mrow><mi>ex</mi></mrow><mrow><mi>r</mi></mrow></msub><mrow><mo>(</mo><mi>n</mi><mo>,</mo><msup><mrow><mi>F</mi></mrow><mrow><mrow><mo>(</mo><mi>r</mi><mo>)</mo></mrow><mo>+</mo></mrow></msup><mo>)</mo></mrow><mo>=</mo><mi>ex</mi><mrow><mo>(</mo><mi>n</mi><mo>,</mo><msub><mrow><mi>K</mi></mrow><mrow><mi>r</mi></mrow></msub><mo>,</mo><mi>F</mi><mo>)</mo></mrow><mo>+</mo><mi>O</mi><mrow><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mi>r</mi><mo>−</mo><mn>1</mn></mrow></msup><mo>)</mo></mrow></mrow></math></span>. The proof comes with a structure theorem that we use to determine <span><math><mrow><msub><mrow><mi>ex</mi></mrow><mrow><mi>r</mi></mrow></msub><mrow><mo>(</mo><mi>n</mi><mo>,</mo><msup><mrow><mi>F</mi></mrow><mrow><mrow><mo>(</mo><mi>r</mi><mo>)</mo></mrow><mo>+</mo></mrow></msup><mo>)</mo></mrow></mrow></math></span> exactly for some graphs <span><math><mi>F</mi></math></span>, every <span><math><mrow><mi>r</mi><mo>&lt;</mo><mi>χ</mi><mrow><mo>(</mo><mi>F</mi><mo>)</mo></mrow></mrow></math></span> and sufficiently large <span><math><mi>n</mi></math></span>.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2024-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0195669824001562/pdfft?md5=86fa8d5991cc3c3ff302bc8fdbd50279&pid=1-s2.0-S0195669824001562-main.pdf","citationCount":"0","resultStr":"{\"title\":\"On non-degenerate Turán problems for expansions\",\"authors\":\"Dániel Gerbner\",\"doi\":\"10.1016/j.ejc.2024.104071\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The <span><math><mi>r</mi></math></span>-uniform expansion <span><math><msup><mrow><mi>F</mi></mrow><mrow><mrow><mo>(</mo><mi>r</mi><mo>)</mo></mrow><mo>+</mo></mrow></msup></math></span> of a graph <span><math><mi>F</mi></math></span> is obtained by enlarging each edge with <span><math><mrow><mi>r</mi><mo>−</mo><mn>2</mn></mrow></math></span> new vertices such that altogether we use <span><math><mrow><mrow><mo>(</mo><mi>r</mi><mo>−</mo><mn>2</mn><mo>)</mo></mrow><mrow><mo>|</mo><mi>E</mi><mrow><mo>(</mo><mi>F</mi><mo>)</mo></mrow><mo>|</mo></mrow></mrow></math></span> new vertices. Two simple lower bounds on the largest number <span><math><mrow><msub><mrow><mi>ex</mi></mrow><mrow><mi>r</mi></mrow></msub><mrow><mo>(</mo><mi>n</mi><mo>,</mo><msup><mrow><mi>F</mi></mrow><mrow><mrow><mo>(</mo><mi>r</mi><mo>)</mo></mrow><mo>+</mo></mrow></msup><mo>)</mo></mrow></mrow></math></span> of <span><math><mi>r</mi></math></span>-edges in <span><math><msup><mrow><mi>F</mi></mrow><mrow><mrow><mo>(</mo><mi>r</mi><mo>)</mo></mrow><mo>+</mo></mrow></msup></math></span>-free <span><math><mi>r</mi></math></span>-graphs are <span><math><mrow><mi>Ω</mi><mrow><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mi>r</mi><mo>−</mo><mn>1</mn></mrow></msup><mo>)</mo></mrow></mrow></math></span> (in the case <span><math><mi>F</mi></math></span> is not a star) and <span><math><mrow><mi>ex</mi><mrow><mo>(</mo><mi>n</mi><mo>,</mo><msub><mrow><mi>K</mi></mrow><mrow><mi>r</mi></mrow></msub><mo>,</mo><mi>F</mi><mo>)</mo></mrow></mrow></math></span>, which is the largest number of <span><math><mi>r</mi></math></span>-cliques in <span><math><mi>n</mi></math></span>-vertex <span><math><mi>F</mi></math></span>-free graphs. We prove that <span><math><mrow><msub><mrow><mi>ex</mi></mrow><mrow><mi>r</mi></mrow></msub><mrow><mo>(</mo><mi>n</mi><mo>,</mo><msup><mrow><mi>F</mi></mrow><mrow><mrow><mo>(</mo><mi>r</mi><mo>)</mo></mrow><mo>+</mo></mrow></msup><mo>)</mo></mrow><mo>=</mo><mi>ex</mi><mrow><mo>(</mo><mi>n</mi><mo>,</mo><msub><mrow><mi>K</mi></mrow><mrow><mi>r</mi></mrow></msub><mo>,</mo><mi>F</mi><mo>)</mo></mrow><mo>+</mo><mi>O</mi><mrow><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mi>r</mi><mo>−</mo><mn>1</mn></mrow></msup><mo>)</mo></mrow></mrow></math></span>. The proof comes with a structure theorem that we use to determine <span><math><mrow><msub><mrow><mi>ex</mi></mrow><mrow><mi>r</mi></mrow></msub><mrow><mo>(</mo><mi>n</mi><mo>,</mo><msup><mrow><mi>F</mi></mrow><mrow><mrow><mo>(</mo><mi>r</mi><mo>)</mo></mrow><mo>+</mo></mrow></msup><mo>)</mo></mrow></mrow></math></span> exactly for some graphs <span><math><mi>F</mi></math></span>, every <span><math><mrow><mi>r</mi><mo>&lt;</mo><mi>χ</mi><mrow><mo>(</mo><mi>F</mi><mo>)</mo></mrow></mrow></math></span> and sufficiently large <span><math><mi>n</mi></math></span>.</div></div>\",\"PeriodicalId\":50490,\"journal\":{\"name\":\"European Journal of Combinatorics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2024-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0195669824001562/pdfft?md5=86fa8d5991cc3c3ff302bc8fdbd50279&pid=1-s2.0-S0195669824001562-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European Journal of Combinatorics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0195669824001562\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0195669824001562","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

图 F 的 r-uniform 扩展 F(r)+ 是通过用 r-2 个新顶点扩大每条边而得到的,这样我们总共使用了 (r-2)|E(F)| 个新顶点。关于无 F(r)+ r 图中 r 边的最大数量 exr(n,F(r)+) 的两个简单下限是 Ω(nr-1)(在 F 不是星形的情况下)和 ex(n,Kr,F),后者是无 n 个顶点的 F 图中 r 簇的最大数量。我们证明,exr(n,F(r)+)=ex(n,Kr,F)+O(nr-1)。该证明包含一个结构定理,我们用它来精确确定某些图 F、每个 r<χ(F)和足够大的 n 的 exr(n,F(r)+)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On non-degenerate Turán problems for expansions
The r-uniform expansion F(r)+ of a graph F is obtained by enlarging each edge with r2 new vertices such that altogether we use (r2)|E(F)| new vertices. Two simple lower bounds on the largest number exr(n,F(r)+) of r-edges in F(r)+-free r-graphs are Ω(nr1) (in the case F is not a star) and ex(n,Kr,F), which is the largest number of r-cliques in n-vertex F-free graphs. We prove that exr(n,F(r)+)=ex(n,Kr,F)+O(nr1). The proof comes with a structure theorem that we use to determine exr(n,F(r)+) exactly for some graphs F, every r<χ(F) and sufficiently large n.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.10
自引率
10.00%
发文量
124
审稿时长
4-8 weeks
期刊介绍: The European Journal of Combinatorics is a high standard, international, bimonthly journal of pure mathematics, specializing in theories arising from combinatorial problems. The journal is primarily open to papers dealing with mathematical structures within combinatorics and/or establishing direct links between combinatorics and other branches of mathematics and the theories of computing. The journal includes full-length research papers on important topics.
期刊最新文献
A combinatorial PROP for bialgebras Signed Mahonian polynomials on derangements in classical Weyl groups Degree conditions for Ramsey goodness of paths Bounded unique representation bases for the integers On the faces of unigraphic 3-polytopes
×
引用
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