arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.03121math.CO
收藏

任意图对的Erdős-Rogers函数

Erdős-Rogers functions for arbitrary pairs of graphs

Dhruv Mubayi, Jacques Verstraete

AI总结:

本文研究任意图对的Erdős-Rogers函数,证明了无三角形图F在K3约束下达到平方根量级,而对含圈的K4-free图F则严格大于立方根量级,并刻画了一般图G下函数呈多项式衰减的条件。

摘要:

设 $f_{F,G}(n)$ 为每个 $n$ 顶点 $G$-free 图都保证包含的诱导 $F$-free 子图的最大规模。我们证明对任意无三角形图 $F$,有 \\[ f_{F,K_3}(n) = f_{K_2,K_3}(n)^{1 + o(1)} = n^{\frac{1}{2} + o(1)}.\\] 在此过程中,当 $r$ 较大时,我们对 Erdős-Frankl-Rödl 关于 Brown-Erdős-Sós $(3r-3,3)$-问题的构造给出了轻微改进。\n 与我们对 $K_3$ 的结果形成对比的是,对任意包含圈的 $K_4$-free 图 $F$,我们证明存在 $c_F > 0$ 使得 $$f_{F,K_4}(n) > f_{K_2,K_4}(n)^{1 + c_F} = n^{\frac{1}{3}+c_F+o(1)}.$$ 对每个图 $G$,我们证明存在 $\varepsilon_G >0$,使得只要 $F$ 是非空图且 $G$ 不包含在 $F$ 的任何膨胀(blowup)中,就有 $f_{F,G}(n) = O(n^{1-\varepsilon_G})$。另一方面,对不是团的图 $G$ 以及每个 $\varepsilon>0$,我们构造出一个 $G$-free 图 $F$ 使得 $f_{F,G}(n) = Ω(n^{1-\varepsilon})$。

英文摘要:

Let $f_{F,G}(n)$ be the largest size of an induced $F$-free subgraph that every $n$-vertex $G$-free graph is guaranteed to contain. We prove that for any triangle-free graph $F$, \[ f_{F,K_3}(n) = f_{K_2,K_3}(n)^{1 + o(1)} = n^{\frac{1}{2} + o(1)}.\] Along the way we give a slight improvement of a construction of Erd\H os-Frankl-Rödl for the Brown-Erd\H os-Sós $(3r-3,3)$-problem when $r$ is large. In contrast to our result for $K_3$, for any $K_4$-free graph $F$ containing a cycle, we prove there exists $c_F > 0$ such that $$f_{F,K_4}(n) > f_{K_2,K_4}(n)^{1 + c_F} = n^{\frac{1}{3}+c_F+o(1)}.$$ \iffalse We also observe that our earlier proof for $F=K_3$ generalizes to $f_{F,K_4}(n) = O(\sqrt{n}\log n)$ for all $F$ containing a cycle. \fi For every graph $G$, we prove that there exists $\varepsilon_G >0$ such that whenever $F$ is a non-empty graph such that $G$ is not contained in any blowup of $F$, then $f_{F,G}(n) = O(n^{1-\varepsilon_G})$. On the other hand, for graph $G$ that is not a clique, and every $\varepsilon>0$, we exhibit a $G$-free graph $F$ such that $f_{F,G}(n) = Ω(n^{1-\varepsilon})$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑