Induced subgraphs of $K_r$-free graphs and the Erdős--Rogers problem

Lior Gishboliner, Oliver Janzer, Benny Sudakov
{"title":"Induced subgraphs of $K_r$-free graphs and the Erdős--Rogers problem","authors":"Lior Gishboliner, Oliver Janzer, Benny Sudakov","doi":"arxiv-2409.06650","DOIUrl":null,"url":null,"abstract":"For two graphs $F,H$ and a positive integer $n$, the function $f_{F,H}(n)$\ndenotes the largest $m$ such that every $H$-free graph on $n$ vertices contains\nan $F$-free induced subgraph on $m$ vertices. This function has been\nextensively studied in the last 60 years when $F$ and $H$ are cliques and\nbecame known as the Erd\\H{o}s-Rogers function. Recently, Balogh, Chen and Luo,\nand Mubayi and Verstra\\\"ete initiated the systematic study of this function in\nthe case where $F$ is a general graph. Answering, in a strong form, a question of Mubayi and Verstra\\\"ete, we prove\nthat for every positive integer $r$ and every $K_{r-1}$-free graph $F$, there\nexists some $\\varepsilon_F>0$ such that\n$f_{F,K_r}(n)=O(n^{1/2-\\varepsilon_F})$. This result is tight in two ways.\nFirstly, it is no longer true if $F$ contains $K_{r-1}$ as a subgraph.\nSecondly, we show that for all $r\\geq 4$ and $\\varepsilon>0$, there exists a\n$K_{r-1}$-free graph $F$ for which $f_{F,K_r}(n)=\\Omega(n^{1/2-\\varepsilon})$.\nAlong the way of proving this, we show in particular that for every graph $F$\nwith minimum degree $t$, we have $f_{F,K_4}(n)=\\Omega(n^{1/2-6/\\sqrt{t}})$.\nThis answers (in a strong form) another question of Mubayi and Verstra\\\"ete.\nFinally, we prove that there exist absolute constants $0<c<C$ such that for\neach $r\\geq 4$, if $F$ is a bipartite graph with sufficiently large minimum\ndegree, then $\\Omega(n^{\\frac{c}{\\log r}})\\leq f_{F,K_r}(n)\\leq\nO(n^{\\frac{C}{\\log r}})$. This shows that for graphs $F$ with large minimum\ndegree, the behaviour of $f_{F,K_r}(n)$ is drastically different from that of\nthe corresponding off-diagonal Ramsey number $f_{K_2,K_r}(n)$.","PeriodicalId":501407,"journal":{"name":"arXiv - MATH - Combinatorics","volume":"98 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.06650","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

For two graphs $F,H$ and a positive integer $n$, the function $f_{F,H}(n)$ denotes the largest $m$ such that every $H$-free graph on $n$ vertices contains an $F$-free induced subgraph on $m$ vertices. This function has been extensively studied in the last 60 years when $F$ and $H$ are cliques and became known as the Erd\H{o}s-Rogers function. Recently, Balogh, Chen and Luo, and Mubayi and Verstra\"ete initiated the systematic study of this function in the case where $F$ is a general graph. Answering, in a strong form, a question of Mubayi and Verstra\"ete, we prove that for every positive integer $r$ and every $K_{r-1}$-free graph $F$, there exists some $\varepsilon_F>0$ such that $f_{F,K_r}(n)=O(n^{1/2-\varepsilon_F})$. This result is tight in two ways. Firstly, it is no longer true if $F$ contains $K_{r-1}$ as a subgraph. Secondly, we show that for all $r\geq 4$ and $\varepsilon>0$, there exists a $K_{r-1}$-free graph $F$ for which $f_{F,K_r}(n)=\Omega(n^{1/2-\varepsilon})$. Along the way of proving this, we show in particular that for every graph $F$ with minimum degree $t$, we have $f_{F,K_4}(n)=\Omega(n^{1/2-6/\sqrt{t}})$. This answers (in a strong form) another question of Mubayi and Verstra\"ete. Finally, we prove that there exist absolute constants $0
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
无 K_r$ 图的诱导子图和厄尔多斯--罗杰斯问题
对于两个图$F,H$和一个正整数$n$,函数$f_{F,H}(n)$表示最大的$m$,使得在$n$顶点上每个无$H$的图都包含一个在$m$顶点上无$F$的诱导子图。在过去的 60 年中,当 $F$ 和 $H$ 都是簇时,这个函数被广泛研究,并被称为 Erd\H{o}s-Rogers 函数。最近,Balogh、Chen 和 Luo 以及 Mubayi 和 Verstra\"ete 开始在 $F$ 是一般图的情况下系统地研究这个函数。我们以强形式回答了穆巴伊和韦斯特拉的一个问题,证明了对于每一个正整数 $r$ 和每一个无 $K_{r-1}$ 的图 $F$,存在某个 $\varepsilon_F>0$ ,使得 $f_{F,K_r}(n)=O(n^{1/2-\varepsilon_F})$ 。首先,如果 $F$ 包含 $K_{r-1}$ 这个子图,那么这个结果就不再成立。其次,我们证明了对于所有 $r\geq 4$ 和 $\varepsilon>0$ 的情况,存在一个不包含 $K_{r-1}$ 的图 $F$,对于这个图 $f_{F,K_r}(n)=\Omega(n^{1/2-\varepsilon})$。在证明这一点的过程中,我们特别指出,对于每个最小度为 $t$ 的图 $F$,我们有 $f_{F,K_4}(n)=\Omega(n^{1/2-6/\sqrt{t}})$。这(以强形式)回答了穆巴伊和韦斯特拉的另一个问题。最后,我们证明了存在绝对常量 $0
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
×
引用
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