An improved bound for disjoint directed cycles |
| |
Authors: | Matija Bucić |
| |
Affiliation: | University of Cambridge, United Kingdom |
| |
Abstract: | We show that every directed graph with minimum out-degree at least contains at least vertex disjoint cycles. This is an improvement over the result of Alon who showed this result for digraphs of minimum out-degree at least . The main benefit of the argument is that getting better results for small values of allows for further improvements to the constant. |
| |
Keywords: | Directed graph Disjoint cycles Minimal out-degree |
本文献已被 ScienceDirect 等数据库收录! |