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

路和圈的Enumeration与不可比图的e-系数

Enumeration of paths and cycles and e-coefficients of incomparability graphs

Gus Wiseman

摘要:

证明了无圈有向图的补图上的Hamilton路数等于圈覆盖数。作为应用,我们得到了不可比图的色对称函数用初等对称函数的一个新的展开式。分析一些组合的影响,这种扩张导致三个双射涉及非循环方向。

英文摘要:

We prove that the number of Hamiltonian paths on the complement of an acyclic digraph is equal to the number of cycle covers. As an application, we obtain a new expansion of the chromatic symmetric function of incomparability graphs in terms of elementary symmetric functions. Analysis of some of the combinatorial implications of this expansion leads to three bijections involving acyclic orientations.

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

↑