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

无($P_2+P_3$,$\bar{P_2+ P_3}$)图的最优色界

Optimal chromatic bound for ($P_2+P_3$, $\bar{P_2+ P_3}$)-free graphs

Arnab Char, T. Karthick

摘要:

对于图$G$,令$χ(G)$($ω(G)$)表示其色(团)数。$P_2+P_3$是通过取两顶点路径$P_2$和三顶点路径$P_3$的不交并而获得的图。$\bar{P_2+P_3}$是$P_2+P_3$的补图。本文研究了一类($P_2+P_3$,$\bar{P_2+P_3}$)-free图,证明了每一类具有$ω(G)\geq 3$的图$G$满足$χ(G)\leq \max \{ω(G)+3, \lfloor\frac{3}{2} ω(G) \rfloor-1 \}$ .此外,边界很紧。实际上,对于任何$k\in {\mathbb N}$和$k\geq 3$,存在一个无($P_2+P_3$,$\bar{P_2+P_3}$)图$G$,使得$ω(G)=k$和$χ(G)=\max\{k+3, \lfloor\frac{3}{2} k \rfloor-1 \}$。

英文摘要:

For a graph $G$, let $χ(G)$ ($ω(G)$) denote its chromatic (clique) number. A $P_2+P_3$ is the graph obtained by taking the disjoint union of a two-vertex path $P_2$ and a three-vertex path $P_3$. A $\bar{P_2+P_3}$ is the complement graph of a $P_2+P_3$. In this paper, we study the class of ($P_2+P_3$, $\bar{P_2+P_3}$)-free graphs and show that every such graph $G$ with $ω(G)\geq 3$ satisfies $χ(G)\leq \max \{ω(G)+3, \lfloor\frac{3}{2} ω(G) \rfloor-1 \}$. Moreover, the bound is tight. Indeed, for any $k\in {\mathbb N}$ and $k\geq 3$, there is a ($P_2+P_3$, $\bar{P_2+P_3}$)-free graph $G$ such that $ω(G)=k$ and $χ(G)=\max\{k+3, \lfloor\frac{3}{2} k \rfloor-1 \}$.

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

↑