中文

最小度小且最大度大的图的过充实性

组合数学 2021-05-13 v1

摘要

给定简单图 GG,分别用 Δ(G)\Delta(G)δ(G)\delta(G)χ(G)\chi'(G) 表示 GG 的最大度、最小度和色指数。若 χ(G)=Δ(G)+1\chi'(G)=\Delta(G)+1 且对 GG 的每个真子图 HHχ(H)Δ(G)\chi'(H)\le \Delta(G),则称 GG 为 \emph{Δ\Delta-临界};若 E(G)>ΔV(G)/2|E(G)|>\Delta \lfloor |V(G)|/2 \rfloor,则称 GG 为 \emph{过充实}。由于 GG 中的最大匹配大小至多为 V(G)/2\lfloor |V(G)|/2 \rfloor,可知若 GG 过充实则 χ(G)=Δ(G)+1\chi'(G) = \Delta(G) +1。反之,设 GGΔ\Delta-临界图。Chetwynd 与 Hilton 著名的过充实猜想断言:若 Δ(G)>V(G)/3\Delta(G) > |V(G)|/3,则 GG 过充实。本文中,我们证明任意 Δ\Delta-临界图 GGΔ(G)7δ(G)/4(3V(G)17)/4\Delta(G) - 7\delta(G)/4\ge(3|V(G)|-17)/4 时过充实。

关键词

引用

@article{arxiv.2105.05333,
  title  = {The overfullness of graphs with small minimum degree and large maximum degree},
  author = {Yan Cao and Guantao Chen and Guangming Jing and Songling Shan},
  journal= {arXiv preprint arXiv:2105.05333},
  year   = {2021}
}

备注

One portion of arXiv:2005.12909 is incorporated into this paper. arXiv admin note: text overlap with arXiv:2004.00734, arXiv:2103.05171