arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.11445math.CO
收藏

点划分为独立集和小分支点的森林

Vertex Partitions into an Independent Set and a Forest with Each Component Small

Daniel W. Cranston, Matthew P. Yancey

摘要:

对于任意整数k >= 2,我们确定mad(G)的一个精确界,使得V(G)可划分为集合I和F_k,其中I是一个独立集,G[F_k]是一个森林,其中每个分支至多有k个顶点.对于每个k,我们构造一个无限族的例子,表明我们的结果是最好的可能。我们的结果意味着每个围长至少为9的可平面图G(分别为1和2)都是可平面图. 8,7)有一个划分V(G)成一个独立集I和一个集F,使得G[F]是一个森林,其中每个分量的阶数至多为3(分别为)。4、6)。Henrik,Norin和Wood要求最大函数g(a,b)使得如果mad(G)< g(a,b)则V(G)有一个划分成集合A和B使得mad(G[A])< a和mad(G[B])< b。他们特别要求g(1,b)的值,即,当A是一个独立集时。以前,已知的唯一值是g(1,4/3)和g(1,2)。当4/3 < b < 2时,我们得到g(1,b)。

英文摘要:

For each integer k >= 2, we determine a sharp bound on mad(G) such that V(G) can be partitioned into sets I and F_k, where I is an independent set and G[F_k] is a forest in which each component has at most k vertices. For each k we construct an infinite family of examples showing our result is best possible. Our results imply that every planar graph G of girth at least 9 (resp. 8, 7) has a partition of V(G) into an independent set I and a set F such that G[F] is a forest with each component of order at most 3 (resp. 4, 6). Hendrey, Norin, and Wood asked for the largest function g(a,b) such that if mad(G) < g(a,b) then V(G) has a partition into sets A and B such that mad(G[A]) < a and mad(G[B]) < b. They specifically asked for the value of g(1,b), i.e., the case when A is an independent set. Previously, the only values known were g(1,4/3) and g(1,2). We find g(1,b) whenever 4/3 < b < 2.

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

↑