Short Cycles in Digraphs

Tsuyoshi Nishimura

doi:10.1016/S0167-5060(08)70796-9

Short Cycles in Digraphs

Research output: Contribution to journal › Article › peer-review

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 [n/k]. With regard to this conjecture, Chvátal and Szemérldi [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 language	English
Pages (from-to)	295-298
Number of pages	4
Journal	Annals of Discrete Mathematics
Volume	38
Issue number	C
DOIs	https://doi.org/10.1016/S0167-5060(08)70796-9
Publication status	Published - 1988 Jan 1
Externally published	Yes

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics

Access to Document

10.1016/S0167-5060(08)70796-9

Fingerprint Dive into the research topics of 'Short Cycles in Digraphs'. Together they form a unique fingerprint.

Cite this

@article{6271cbb52fd54b1ebaa67cfd95df19ed,

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 [n/k]. With regard to this conjecture, Chv{\'a}tal and Szem{\'e}rldi [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",

month = jan,

day = "1",

doi = "10.1016/S0167-5060(08)70796-9",

language = "English",

volume = "38",

pages = "295--298",

journal = "Annals of Discrete Mathematics",

issn = "0167-5060",

publisher = "Elsevier",

number = "C",

}

TY - JOUR

T1 - Short Cycles in Digraphs

AU - Nishimura, Tsuyoshi

PY - 1988/1/1

Y1 - 1988/1/1

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 [n/k]. With regard to this conjecture, Chvátal and Szemérldi [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 [n/k]. With regard to this conjecture, Chvátal and Szemérldi [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=77957045838&partnerID=8YFLogxK

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

U2 - 10.1016/S0167-5060(08)70796-9

DO - 10.1016/S0167-5060(08)70796-9

M3 - Article

AN - SCOPUS:77957045838

VL - 38

SP - 295

EP - 298

JO - Annals of Discrete Mathematics

JF - Annals of Discrete Mathematics

SN - 0167-5060

IS - C

ER -

Short Cycles in Digraphs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this