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

图中大诱导森林的新结果

New results on large induced forests in graphs

Shimon Kogan

摘要:

对于图$G$,令$a(G)$表示导出森林的顶点子集的最大大小。我们证明了以下几点。1.设$G$是一个图,其阶数为$n$,最大度为$Δ>0$,最大团数为$ω$。那么\[ a(G) \geq \frac{6n}{2Δ+ ω+2}. \]这个界限对于集团是很尖锐的。2.设$G=(V,E)$是一个无三角形图,$d(v)$表示$v \in V$的度.然后\[ a(G) \geq \sum_{v \in V} \min\left(1, \frac{3}{d(v)+2} \right). \]作为推论,我们有一个三角形自由图$G$阶$n$,与$m$边和平均度$d \geq 2$满足\[ a(G) \geq \frac{3n}{d+2}. \]这改善了下界$n - \frac{m}{4}$的Alon-Mubayi-Thomas的图的平均度大于$4$。此外,对于平均度至少为$\frac{9}{2}$的(连通)图,改进了Shi-Xu的下界$\frac{20n - 5m - 5}{19}$.

英文摘要:

For a graph $G$, let $a(G)$ denote the maximum size of a subset of vertices that induces a forest. We prove the following. 1. Let $G$ be a graph of order $n$, maximum degree $Δ>0$ and maximum clique size $ω$. Then \[ a(G) \geq \frac{6n}{2Δ+ ω+2}. \] This bound is sharp for cliques. 2. Let $G=(V,E)$ be a triangle-free graph and let $d(v)$ denote the degree of $v \in V$. Then \[ a(G) \geq \sum_{v \in V} \min\left(1, \frac{3}{d(v)+2} \right). \] As a corollary we have that a triangle-free graph $G$ of order $n$, with $m$ edges and average degree $d \geq 2$ satisfies \[ a(G) \geq \frac{3n}{d+2}. \] This improves the lower bound $n - \frac{m}{4}$ of Alon-Mubayi-Thomas for graphs of average degree greater than $4$. Furthermore it improves the lower bound $\frac{20n - 5m - 5}{19}$ of Shi-Xu for (connected) graphs of average degree at least $\frac{9}{2}$.

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

↑