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

具有割顶点的图缺失某种连通划分

Graphs missing a connected partition

Department of Mathematics, MIT(麻省理工学院数学系)

Foster Tom

AI总结:

该研究证明具有特定结构的图无法拥有$e$-正的染色对称函数,接近关于树非$e$-正性的猜想。

摘要:

我们证明,如果一个图删除一个割顶点后产生至少五个连通组件,则该图必须缺失某种类型的连通划分。我们还证明,如果存在四个连通组件,每个至少有两个顶点,则这一结论同样成立。特别是,此类图的染色对称函数不能是$e$-正的。这使我们非常接近Dahlberg、She和van Willigenburg关于所有具有至少四个度数的树非$e$-正性的猜想。我们还证明,具有四个腿的蜘蛛不能有$e$-正的染色对称函数。

英文摘要:

We prove that a graph with a cut vertex whose deletion produces at least five connected components must be missing a connected partition of some type. We prove that this also holds if there are four connected components that each have at least two vertices. In particular, the chromatic symmetric function of such a graph cannot be $e$-positive. This brings us very close to the conjecture by Dahlberg, She, and van Willigenburg of non-$e$-positivity for all trees with a vertex of degree at least four. We also prove that spiders with four legs cannot have an $e$-positive chromatic symmetric function.

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

↑