$r$-图中 1-因子的并集与过满图
组合数学
2019-10-07 v2
摘要
我们证明了 -图中能被 个 1-因子的并集覆盖的边比例的下界。特例 给出了立方图的一些已知结果。此外，我们引入了无 -过满 -图的概念，并为这些图得到了更好的界。
引用
@article{arxiv.1509.01823,
title = {Unions of 1-factors in $r$-graphs and overfull graphs},
author = {Ligang Jin and Eckhard Steffen},
journal= {arXiv preprint arXiv:1509.01823},
year = {2019}
}
备注
14 pages, no figure, 1 table. To be published in Journal of Combinatorics. Difference from the previous version: We add the results on overfull graphs, stated in Chapter 4; Moreover, Corollary 3.2 is new