Disjoint directed cycles
type: Item
instance of: scholarly article
title: Disjoint directed cycles
zbMATH Open document ID: 0861.05037
published in: Journal of Combinatorial Theory. Series B
publication date: 1996-12-08T00:00:00Z
review text: It is shown that there exists a positive \(\varepsilon\) so that for any integer \(k\), every directed graph with minimum outdegree at least \(k\) contains at least \(\varepsilon 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.
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 954821
zbMATH Keywords: probabilistic method
zbMATH Keywords: digraph
zbMATH Keywords: disjoint cycles
author: Noga Alon
reviewed by: Noga Alon
MaRDI profile type: Publication
full work available at URL: jctb.1996.0062
OpenAlex ID: W1974181313
DOI: 10.1006/JCTB.1996.0062
description: scientific article; zbMATH DE number 954821