边色临界图的独立数
组合数学
2018-05-17 v1
摘要
设 G G G 为最大度 Δ ( G ) \Delta(G) Δ ( G ) 与色指数 χ ′ ( G ) \chi'(G) χ ′ ( G ) 的简单图。Vizing 的经典结果表明 χ ′ ( G ) = Δ ( G ) \chi'(G)=\Delta(G) χ ′ ( G ) = Δ ( G ) 或 χ ′ ( G ) = Δ ( G ) + 1 \chi'(G)=\Delta(G)+1 χ ′ ( G ) = Δ ( G ) + 1 。若 G G G 连通、χ ′ ( G ) = Δ ( G ) + 1 \chi'(G)=\Delta(G)+1 χ ′ ( G ) = Δ ( G ) + 1 且对任意 e ∈ E ( G ) e\in E(G) e ∈ E ( G ) 有 χ ′ ( G − e ) = Δ ( G ) \chi'(G-e)=\Delta(G) χ ′ ( G − e ) = Δ ( G ) ,则称 G G G 为 Δ \Delta Δ -临界图。设 G G G 为 n n n 顶点 Δ \Delta Δ -临界图。Vizing 猜想其独立数 α ( G ) \alpha(G) α ( G ) 至多为 n 2 \frac{n}{2} 2 n 。Woodall 给出的该猜想当前最佳结果为 α ( G ) < 3 n 5 \alpha(G)<\frac{3n}{5} α ( G ) < 5 3 n 。我们证明对任意给定 ε ∈ ( 0 , 1 ) \varepsilon\in (0,1) ε ∈ ( 0 , 1 ) ,存在正常数 d 0 ( ε ) d_0(\varepsilon) d 0 ( ε ) 与 D 0 ( ε ) D_0(\varepsilon) D 0 ( ε ) ,使得若 G G G 为最小度至少 d 0 d_0 d 0 且最大度至少 D 0 D_0 D 0 的 n n n 顶点 Δ \Delta Δ -临界图,则 α ( G ) < ( 1 2 + ε ) n \alpha(G)<(\frac{{1}}{2}+\varepsilon)n α ( G ) < ( 2 1 + ε ) n 。特别地,我们证明若 G G G 为最小度至少 d d d 且 Δ ( G ) ≥ ( d + 2 ) 5 d + 10 \Delta(G)\ge (d+2)^{5d+10} Δ ( G ) ≥ ( d + 2 ) 5 d + 10 的 n n n 顶点 Δ \Delta Δ -临界图,则 α ( G ) < { 7 n 12 , if d = 3 ; 4 n 7 , if d = 4 ; d + 2 + ( d − 1 ) d 3 2 d + 4 + ( d − 1 ) d 3 n < 4 n 7 , if d ≥ 19 . \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. α ( G ) < { 12 7 n , if d = 3; 7 4 n , if d = 4; 2 d + 4 + 3 ( d − 1 ) d d + 2 + 3 ( d − 1 ) d n < 7 4 n , if d ≥ 19.
引用
@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}
}