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

关于树的独立集序列

On the independent set sequence of a tree

Abdul Basit, David Galvin

摘要:

Alavi,Malde,Schwenk和Erdensys问是否每个树的独立集序列是单峰的。在这里,我们对这个问题做一些观察。我们证明了对于一致随机(标号)树,渐近几乎必然(a.a.s.)序列的初始约49.5%在增加,而末端约38.8%在减少。我们的方法使用矩阵树定理,结合计算。我们也给出了Levit和Mandrescu关于König-Egerváry图的独立集序列的最后三分之一的结果的推广。

英文摘要:

Alavi, Malde, Schwenk and Erdős asked whether the independent set sequence of every tree is unimodal. Here we make some observations about this question. We show that for the uniformly random (labelled) tree, asymptotically almost surely (a.a.s.) the initial approximately 49.5\% of the sequence is increasing while the terminal approximately 38.8\% is decreasing. Our approach uses the Matrix Tree Theorem, combined with computation. We also present a generalization of a result of Levit and Mandrescu, concerning the final one-third of the independent set sequence of a König-Egerváry graph.

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

↑