中文

边色临界图的独立数

组合数学 2018-05-17 v1

摘要

GG 为最大度 Δ(G)\Delta(G) 与色指数 χ(G)\chi'(G) 的简单图。Vizing 的经典结果表明 χ(G)=Δ(G)\chi'(G)=\Delta(G)χ(G)=Δ(G)+1\chi'(G)=\Delta(G)+1。若 GG 连通、χ(G)=Δ(G)+1\chi'(G)=\Delta(G)+1 且对任意 eE(G)e\in E(G)χ(Ge)=Δ(G)\chi'(G-e)=\Delta(G),则称 GGΔ\Delta-临界图。设 GGnn 顶点 Δ\Delta-临界图。Vizing 猜想其独立数 α(G)\alpha(G) 至多为 n2\frac{n}{2}。Woodall 给出的该猜想当前最佳结果为 α(G)<3n5\alpha(G)<\frac{3n}{5}。我们证明对任意给定 ε(0,1)\varepsilon\in (0,1),存在正常数 d0(ε)d_0(\varepsilon)D0(ε)D_0(\varepsilon),使得若 GG 为最小度至少 d0d_0 且最大度至少 D0D_0nn 顶点 Δ\Delta-临界图,则 α(G)<(12+ε)n\alpha(G)<(\frac{{1}}{2}+\varepsilon)n。特别地,我们证明若 GG 为最小度至少 ddΔ(G)(d+2)5d+10\Delta(G)\ge (d+2)^{5d+10}nn 顶点 Δ\Delta-临界图,则 α(G)<{7n12,if d=34n7,if d=4d+2+(d1)d32d+4+(d1)d3n<4n7,if d19 \alpha(G) < \left. \begin{cases} \frac{7n}{12}, & \text{if $d= 3$; } \frac{4n}{7}, & \text{if $d= 4$; } \frac{d+2+\sqrt[3]{(d-1)d}}{2d+4+\sqrt[3]{(d-1)d}}n<\frac{4n}{7}, & \text{if $d\ge 19$. } \end{cases} \right.

关键词

引用

@article{arxiv.1805.05996,
  title  = {Independence number of edge-chromatic critical graphs},
  author = {Yan Cao and Guantao Chen and Guangming Jing and Songling Shan},
  journal= {arXiv preprint arXiv:1805.05996},
  year   = {2018}
}