Short cycles in directed graphs
type: Item
instance of: scholarly article
title: Short cycles in directed graphs
zbMATH Open document ID: 0545.05038
DOI: 10.1016/0095-8956(83)90059-X
author: Vašek Chvátal
author: Endre Szemerédi
published in: Journal of Combinatorial Theory. Series B
publication date: 1983-01-01T00:00:00Z
review text: The authors prove, by an inductive argument, that every directed graph with n vertices and minimum outdegree k contains a directed cycle of length at most \(n/K+2500.\)
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 3867367
zbMATH Keywords: cycle length
zbMATH Keywords: minimum outdegree
zbMATH Keywords: directed cycle
reviewed by: Louis Caccetta
MaRDI profile type: Publication
cites work: Q4192089
cites work: A note on the girth of digraphs
description: scientific article; zbMATH DE number 3867367