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

局部稀疏图着色

Coloring locally sparse graphs

Georgia Institute of Technology(佐治亚理工学院);University of Illinois Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校)

James Anderson, Abhishek Dhawan, Aiya Kuchukova

AI总结:

本文提出(k, F)-局部稀疏性概念,利用Rödl nibble方法证明了双色图F下图G的色数界,改进了现有结果并适用于更广泛的着色场景。

摘要:

一个图G是k-局部稀疏的,如果每个顶点v∈V(G)的诱导子图包含至多k条边。Alon、Krivelevich和Sudakov证明,如果图G的最大度为Δ,且G是Δ²/f-局部稀疏的,则χ(G)=O(Δ/log f)。我们引入了更一般的局部稀疏性概念,定义图G为(k, F)-局部稀疏的,如果对于每个顶点v∈V(G),其邻域诱导子图包含至多k个F的副本。运用Rödl nibble方法,我们证明了上述结果的推广:对于每一个双色图F,如果G是(k, F)-局部稀疏的,则χ(G)=O(Δ/log(Δk^{-1/|V(F)|}))。这改进了Davies、Kang、Pirot和Sereni考虑F为路径情况的结果。我们的结果也恢复了当G是K_{1,t,t}-free时χ(G)的最佳已知界,并适用于更一般的所谓

英文摘要:

A graph $G$ is $k$-locally sparse if for each vertex $v \in V(G)$, the subgraph induced by its neighborhood contains at most $k$ edges. Alon, Krivelevich, and Sudakov showed that for $f > 0$ if a graph $G$ of maximum degree $Δ$ is $Δ^2/f$-locally-sparse, then $χ(G) = O\left(Δ/\log f\right)$. We introduce a more general notion of local sparsity by defining graphs $G$ to be $(k, F)$-locally-sparse for some graph $F$ if for each vertex $v \in V(G)$ the subgraph induced by the neighborhood of $v$ contains at most $k$ copies of $F$. Employing the Rödl nibble method, we prove the following generalization of the above result: for every bipartite graph $F$, if $G$ is $(k, F)$-locally-sparse, then $χ(G) = O\left( Δ/\log\left(Δk^{-1/|V(F)|}\right)\right)$. This improves upon results of Davies, Kang, Pirot, and Sereni who consider the case when $F$ is a path. Our results also recover the best known bound on $χ(G)$ when $G$ is $K_{1, t, t}$-free for $t \geq 4$, and hold for list and correspondence coloring in the more general so-called ''color-degree'' setting.

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

↑