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

稀疏$k$ -临界图的结构

Structure in sparse $k$-critical graphs

Ron Gould, Victor Larsen, Luke Postle

摘要:

最近,Kostochka和Yancey证明了Ore的一个猜想是渐近正确的,证明了每一个$k$ -临界图都满足$|E(G)|\geq\left\lceil\left(\frac{k}{2}-\frac{1}{k-1}\right)|V(G)|-\frac{k(k-3)}{2(k-1)}\right\rceil.$.他们还刻画了达到这个界的图类,并证明了它等价于$k$ -Ore图的集合.我们证明了对于任何$k\geq33$都存在一个$\varepsilon>0$,使得如果$G$是一个$k$ -临界图,则有$|E(G)|\geq\left(\frac{k}{2}-\frac{1}{k-1}+\varepsilon_k\right)|V(G)|-\frac{k(k-3)}{2(k-1)}-(k-1)\varepsilon T(G)$,其中$T(G)$是$G$中不相交的$K_{k-1}$和$K_{k-2}$子图的个数的度量.对于$k\geq33$,这也证明了Postle关于渐近密度的猜想:对于每个$k\geq4$,存在一个$\varepsilon_k>0$使得如果$G$是一个$k$ -临界$K_{k-2}$ -free图,则$|E(G)|\geq \left(\frac{k}{2}-\frac{1}{k-1}+\varepsilon_k\right)|V(G)|-\frac{k(k-3)}{2(k-1)}$ .作为推论,我们的结果表明,不相交的$K_{k-2}$子图在$k$-Ore图的数量与顶点数成线性比例,进一步,这也是正确的图的边数接近Kostochka和Yancey的界限。

英文摘要:

Recently, Kostochka and Yancey proved that a conjecture of Ore is asymptotically true by showing that every $k$-critical graph satisfies $|E(G)|\geq\left\lceil\left(\frac{k}{2}-\frac{1}{k-1}\right)|V(G)|-\frac{k(k-3)}{2(k-1)}\right\rceil.$ They also characterized the class of graphs that attain this bound and showed that it is equivalent to the set of $k$-Ore graphs. We show that for any $k\geq33$ there exists an $\varepsilon>0$ so that if $G$ is a $k$-critical graph, then $|E(G)|\geq\left(\frac{k}{2}-\frac{1}{k-1}+\varepsilon_k\right)|V(G)|-\frac{k(k-3)}{2(k-1)}-(k-1)\varepsilon T(G)$, where $T(G)$ is a measure of the number of disjoint $K_{k-1}$ and $K_{k-2}$ subgraphs in $G$. This also proves for $k\geq33$ the following conjecture of Postle regarding the asymptotic density: For every $k\geq4$ there exists an $\varepsilon_k>0$ such that if $G$ is a $k$-critical $K_{k-2}$-free graph, then $|E(G)|\geq \left(\frac{k}{2}-\frac{1}{k-1}+\varepsilon_k\right)|V(G)|-\frac{k(k-3)}{2(k-1)}$. As a corollary, our result shows that the number of disjoint $K_{k-2}$ subgraphs in a $k$-Ore graph scales linearly with the number of vertices and, further, that the same is true for graphs whose number of edges is close to Kostochka and Yancey's bound.

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

↑