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

无$K_Δ$图的分数色数

The fractional chromatic number of $K_Δ$-free graphs

Xiaolan Hu, Xing Peng

摘要:

对于一个简单图$G$,设$χ_f(G)$是$G$的分数色数.在本文中,我们的目标是建立上界的$χ_f(G)$的图$G$的团数的限制。也就是说,我们证明了对于$Δ\geq 4$,如果$G$的最大度至多为$Δ$,并且是$K_Δ$ -free的,则除非$G= C^2_8$或$G = C_5\boxtimes K_2$,否则$χ_f(G) \leq Δ-\tfrac{1}{8}$.这证明了[King,Lu,and Peng,SIAM J. Discrete Math.,26(2)(2012),pp. 452-471],结果参见[Katherine和King,SIAM J.Discrete Math.,27(2)(2013),pp. 1184-1208]用于$Δ\in \{6,7,8\}$。

英文摘要:

For a simple graph $G$, let $χ_f(G)$ be the fractional chromatic number of $G$. In this paper, we aim to establish upper bounds on $χ_f(G)$ for those graphs $G$ with restrictions on the clique number. Namely, we prove that for $Δ\geq 4$, if $G$ has maximum degree at most $Δ$ and is $K_Δ$-free, then $χ_f(G) \leq Δ-\tfrac{1}{8}$ unless $G= C^2_8$ or $G = C_5\boxtimes K_2$. This im proves the result in [King, Lu, and Peng, SIAM J. Discrete Math., 26(2) (2012), pp. 452-471] for $Δ\geq 4$ and the result in [Katherine and King, SIAM J.Discrete Math., 27(2) (2013), pp. 1184-1208] for $Δ\in \{6,7,8\}$.

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

↑