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

相异度与齐次集

Distinct degrees and homogeneous sets

Eoin Long, Laurentiu Ploscaru

摘要:

本文研究了图$G$中最大齐次集的阶数与导出子图中出现的最大不同度数之间的极值关系,分别记为$\hom (G)$和$f(G)$ .我们的主要定理提高了估计,由于一些早期的研究人员,并表明,如果$G$是一个$n$ -顶点图与$\hom (G) \geq n^{1/2}$,然后$f(G) \geq \big ( {n}/{\hom (G)} \big )^{1 - o(1)}$。这里的界限是尖锐的$o(1)$ -长期,并渐近解决了纳拉亚南和Tomon的猜想。特别是,这意味着$\max \{ \hom (G), f(G) \} \geq n^{1/2 -o(1)}$对于任何$n$ -顶点图$G$,它也是尖锐的. $\hom (G)$和$f(G)$之间的上述关系在其中$\hom (G) < n^{1/2}$ .我们的第二个结果提供了一个尖锐的界限不同程度的有偏随机图,即$f\big (G(n,p) \big )$。我们相信,这里的行为决定了在第二种状态下$\hom (G)$和$f(G)$之间的极端关系。我们的方法下界$f(G)$收益通过翻译成一个(几乎)等价的概率问题,它可以被证明是有效的任意图形。它可能是独立的利益。

英文摘要:

In this paper we investigate the extremal relationship between two well-studied graph parameters: the order of the largest homogeneous set in a graph $G$ and the maximal number of distinct degrees appearing in an induced subgraph of $G$, denoted respectively by $\hom (G)$ and $f(G)$. Our main theorem improves estimates due to several earlier researchers and shows that if $G$ is an $n$-vertex graph with $\hom (G) \geq n^{1/2}$ then $f(G) \geq \big ( {n}/{\hom (G)} \big )^{1 - o(1)}$. The bound here is sharp up to the $o(1)$-term, and asymptotically solves a conjecture of Narayanan and Tomon. In particular, this implies that $\max \{ \hom (G), f(G) \} \geq n^{1/2 -o(1)}$ for any $n$-vertex graph $G$,which is also sharp. The above relationship between $\hom (G)$ and $f(G)$ breaks down in the regime where $\hom (G) < n^{1/2}$. Our second result provides a sharp bound for distinct degrees in biased random graphs, i.e. on $f\big (G(n,p) \big )$. We believe that the behaviour here determines the extremal relationship between $\hom (G)$ and $f(G)$ in this second regime. Our approach to lower bounding $f(G)$ proceeds via a translation into an (almost) equivalent probabilistic problem, and it can be shown to be effective for arbitrary graphs. It may be of independent interest.

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

↑