Short cycles in digraphs

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

Caccetta and Häggkvist [1] conjectured that every digraph with n vertices and minimum outdegree k contains a directed cycle of length at most {plus 45 degree rule}n/k. With regard to this conjecture, Chvátal and Szemerédi [2] proved that if G is a digraph with n vertices and if each of these vertices has outdegree at least k, then G contains a cycle of length at most (n/k) + 2500. Our result is an improvement of this result.

Original languageEnglish
Pages (from-to)295-298
Number of pages4
JournalDiscrete Mathematics
Volume72
Issue number1-3
DOIs
Publication statusPublished - 1988
Externally publishedYes

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Short cycles in digraphs. / Nishimura, Tsuyoshi.

In: Discrete Mathematics, Vol. 72, No. 1-3, 1988, p. 295-298.

Research output: Contribution to journalArticle

Nishimura, Tsuyoshi. / Short cycles in digraphs. In: Discrete Mathematics. 1988 ; Vol. 72, No. 1-3. pp. 295-298.
@article{c376b96383554b63a9d2fb68379ff642,
title = "Short cycles in digraphs",
abstract = "Caccetta and H{\"a}ggkvist [1] conjectured that every digraph with n vertices and minimum outdegree k contains a directed cycle of length at most {plus 45 degree rule}n/k. With regard to this conjecture, Chv{\'a}tal and Szemer{\'e}di [2] proved that if G is a digraph with n vertices and if each of these vertices has outdegree at least k, then G contains a cycle of length at most (n/k) + 2500. Our result is an improvement of this result.",
author = "Tsuyoshi Nishimura",
year = "1988",
doi = "10.1016/0012-365X(88)90219-1",
language = "English",
volume = "72",
pages = "295--298",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Short cycles in digraphs

AU - Nishimura, Tsuyoshi

PY - 1988

Y1 - 1988

N2 - Caccetta and Häggkvist [1] conjectured that every digraph with n vertices and minimum outdegree k contains a directed cycle of length at most {plus 45 degree rule}n/k. With regard to this conjecture, Chvátal and Szemerédi [2] proved that if G is a digraph with n vertices and if each of these vertices has outdegree at least k, then G contains a cycle of length at most (n/k) + 2500. Our result is an improvement of this result.

AB - Caccetta and Häggkvist [1] conjectured that every digraph with n vertices and minimum outdegree k contains a directed cycle of length at most {plus 45 degree rule}n/k. With regard to this conjecture, Chvátal and Szemerédi [2] proved that if G is a digraph with n vertices and if each of these vertices has outdegree at least k, then G contains a cycle of length at most (n/k) + 2500. Our result is an improvement of this result.

UR - http://www.scopus.com/inward/record.url?scp=0013011158&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0013011158&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(88)90219-1

DO - 10.1016/0012-365X(88)90219-1

M3 - Article

AN - SCOPUS:0013011158

VL - 72

SP - 295

EP - 298

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -