arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1903.11268math.COcs.DM
收藏

关于无导出五点路或滑翔伞的图

On graphs with no induced five-vertex path or paraglider

Shenwei Huang, T. Karthick

摘要:

给定两个图$H_1$和$H_2$,一个图是$(H_1,\,H_2)$ -free的,如果它不包含同构于$H_1$或$H_2$的导出子图.对于正整数$t$,$P_t$是$t$顶点上的无弦路径。滑翔伞是由一个无弦循环$C_4$加上一个与$C_4$的三个顶点相邻的顶点组成的图。本文研究了($P_5$,paraglider)-free图的结构,证明了每一个这样的图$G$都满足$χ(G)\le \lceil \frac{3}{2}ω(G) \rceil$,其中$χ(G)$和$ω(G)$分别是$G$的色数和团数.我们的界限是由16个顶点的Clebsch图的补图得到的。更强地,我们完全刻画了所有的($P_5$,paraglider)-free图$G$满足$χ(G)> \frac{3}{2}ω(G)$。我们还构造了一个无限族的($P_5$,paraglider)-free图,使得族中的每个图$G$都有$χ(G)=\lceil \frac{3}{2}ω(G) \rceil-1$ .这表明,我们的上界是最佳的添加剂常数,并没有$(\frac{3}{2}-ε)$ -近似算法的($P_5$,paraglider)-免费图的任何$ε>0$的色数。

英文摘要:

Given two graphs $H_1$ and $H_2$, a graph is $(H_1,\,H_2)$-free if it contains no induced subgraph isomorphic to $H_1$ or $H_2$. For a positive integer $t$, $P_t$ is the chordless path on $t$ vertices. A paraglider is the graph that consists of a chorless cycle $C_4$ plus a vertex adjacent to three vertices of the $C_4$. In this paper, we study the structure of ($P_5$, paraglider)-free graphs, and show that every such graph $G$ satisfies $χ(G)\le \lceil \frac{3}{2}ω(G) \rceil$, where $χ(G)$ and $ω(G)$ are the chromatic number and clique number of $G$, respectively. Our bound is attained by the complement of the Clebsch graph on 16 vertices. More strongly, we completely characterize all the ($P_5$, paraglider)-free graphs $G$ that satisfies $χ(G)> \frac{3}{2}ω(G)$. We also construct an infinite family of ($P_5$, paraglider)-free graphs such that every graph $G$ in the family has $χ(G)=\lceil \frac{3}{2}ω(G) \rceil-1$. This shows that our upper bound is optimal up to an additive constant and that there is no $(\frac{3}{2}-ε)$-approximation algorithm to the chromatic number of ($P_5$, paraglider)-free graphs for any $ε>0$.

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

↑