Directed triangles in directed graphs

M. de Graaf; A. Schrijver; P. D. Seymour

doi:10.1016/0012-365X(92)90719-V

Directed triangles in directed graphs

M. de Graaf
, A. Schrijver
, P. D. Seymour

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

10 Scopus citations

Abstract

We show that each directed graph on n vertices, each with indegree and outdegree at least n/t, where t=5- 5+ 1 2 47-21 5=2.8670975⋯, contains a directed circuit of length at most 3.

Original language	English (US)
Pages (from-to)	279-282
Number of pages	4
Journal	Discrete Mathematics
Volume	110
Issue number	1-3
DOIs	https://doi.org/10.1016/0012-365X(92)90719-V
State	Published - Dec 11 1992
Externally published	Yes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/0012-365X(92)90719-V

Cite this

@article{a522564db0ad440187a97744a2baccc9,

title = "Directed triangles in directed graphs",

abstract = "We show that each directed graph on n vertices, each with indegree and outdegree at least n/t, where t=5- 5+ 1 2 47-21 5=2.8670975⋯, contains a directed circuit of length at most 3.",

author = "\{de Graaf\}, M. and A. Schrijver and Seymour, \{P. D.\}",

year = "1992",

month = dec,

day = "11",

doi = "10.1016/0012-365X(92)90719-V",

language = "English (US)",

volume = "110",

pages = "279--282",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "1-3",

}

TY - JOUR

T1 - Directed triangles in directed graphs

AU - de Graaf, M.

AU - Schrijver, A.

AU - Seymour, P. D.

PY - 1992/12/11

Y1 - 1992/12/11

N2 - We show that each directed graph on n vertices, each with indegree and outdegree at least n/t, where t=5- 5+ 1 2 47-21 5=2.8670975⋯, contains a directed circuit of length at most 3.

AB - We show that each directed graph on n vertices, each with indegree and outdegree at least n/t, where t=5- 5+ 1 2 47-21 5=2.8670975⋯, contains a directed circuit of length at most 3.

UR - https://www.scopus.com/pages/publications/38249010699

UR - https://www.scopus.com/pages/publications/38249010699#tab=citedBy

U2 - 10.1016/0012-365X(92)90719-V

DO - 10.1016/0012-365X(92)90719-V

M3 - Article

AN - SCOPUS:38249010699

SN - 0012-365X

VL - 110

SP - 279

EP - 282

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

Directed triangles in directed graphs

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this