arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2409.14134math.CO
收藏

不同的度数与齐次集合 II

Distinct degrees and homogeneous sets II

Eoin Long, Laurentiu Ploscaru

AI总结:

本文证明了当 $\hom(G) \leq n^{1/2}$ 时 $f(G)$ 的下界,结合先前工作完整确立了图中不同度数与最大齐次集之间的渐近紧致极值关系。

摘要:

给定一个 $n$ 顶点图 $G$,令 $\hom(G)$ 表示 $G$ 中最大齐次集的大小,令 $f(G)$ 表示 $G$ 的某个导出子图中出现的不同度数的最大数量。这些参数之间的关系在过去 40 年中被多位研究者深入研究,始于 Erdős、Faudree 和 Sós 在 $\hom(G) = O(\log n)$ 的 Ramsey 情形下的工作。本文的主要结果证明,任意满足 $\hom(G) \leq n^{1/2}$ 的 $n$ 顶点图 $G$ 都满足 $f(G) \geq \sqrt[3]{\frac{n^2}{\hom(G)}} \cdot n^{-o(1)}$。这证实了作者在先前工作中提出的一个猜想,在该工作中我们处理了 $\hom(G) \geq n^{1/2}$ 的情形。综合起来,这些结果(渐近地)给出了这些参数之间完整的极值关系,表明任意 $n$ 顶点图 $G$ 都满足 $\max \Big( f(G) \cdot \hom(G), \sqrt{f(G)^3 \cdot \hom(G)} \Big) \geq n^{1-o(1)}$。对于从 $\Omega(\log n)$ 到 $n$ 的所有可能的 $\hom(G)$ 取值,该关系(除了 $n^{-o(1)}$ 项外)都是紧的,这一点由适当生成的 Erdős-Renyi 随机图所证明。

英文摘要:

Given an $n$-vertex graph $G$, let $\hom (G)$ denote the size of a largest homogeneous set in $G$ and let $f(G)$ denote the maximal number of distinct degrees appearing in an induced subgraph of $G$. The relationship between these parameters has been well studied by several researchers over the last 40 years, beginning with Erdős, Faudree and Sós in the Ramsey regime when $\hom (G) = O(\log n)$. Our main result here proves that any $n$-vertex graph $G$ with $\hom (G) \leq n^{1/2}$ satisfies \begin{align*} f(G) \geq \sqrt[3]{\frac {n^2}{\hom (G)} } \cdot n^{-o(1)}. \end{align*} This confirms a conjecture of the authors from a previous work, in which we addressed the $\hom (G) \geq n^{1/2}$ regime. Together, these provide the complete extremal relationship between these parameters (asymptotically), showing that any $n$-vertex graph $G$ satisfies \begin{align*} \max \Big ( f(G) \cdot \hom (G), \sqrt {f(G) ^3 \cdot \hom (G) } \Big ) \geq n^{1-o(1)}. \end{align*} This relationship is tight (up to the $n^{-o(1)}$ term) for all possible values of $\hom (G)$, from $Ω(\log n )$ to $n$, as demonstrated by appropriately generated Erdős $-$ Renyi random graphs.

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

↑