TY - JOUR
T1 - Disjoint directed cycles
AU - Alon, Noga
N1 - Funding Information:
* E-mail: noga math.tau.ac.il. Research supported in part by U.S.A. Israel BSF grant and by the Fund for Basic Research administered by the Israel Academy of Sciences.
PY - 1996/11
Y1 - 1996/11
N2 - It is shown that there exists a positive ε so that for any integer k, every directed graph with minimum outdegree at least k contains at least εk vertex disjoint cycles. On the other hand, for every k there is a digraph with minimum outdegree k which does not contain two vertex or edge disjoint cycles of the same length.
AB - It is shown that there exists a positive ε so that for any integer k, every directed graph with minimum outdegree at least k contains at least εk vertex disjoint cycles. On the other hand, for every k there is a digraph with minimum outdegree k which does not contain two vertex or edge disjoint cycles of the same length.
UR - http://www.scopus.com/inward/record.url?scp=0030295782&partnerID=8YFLogxK
U2 - 10.1006/jctb.1996.0062
DO - 10.1006/jctb.1996.0062
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0030295782
SN - 0095-8956
VL - 68
SP - 167
EP - 178
JO - Journal of Combinatorial Theory. Series B
JF - Journal of Combinatorial Theory. Series B
IS - 2
ER -