用度序列界定图中圈的个数
组合数学
2019-07-30 v1
摘要
我们给出了简单图中圈的个数关于其度序列的上界,并应用该上界解决了 Király 以及 Arman 和 Tsaturian 的若干猜想,同时改进了平面图圈数最大值的上界。
引用
@article{arxiv.1907.12091,
title = {Bounding the number of cycles in a graph in terms of its degree sequence},
author = {Zdeněk Dvořák and Natasha Morrison and Jonathan A. Noel and Sergey Norin and Luke Postle},
journal= {arXiv preprint arXiv:1907.12091},
year = {2019}
}