Directed triangles in directed graphs

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

Research output: Contribution to journalArticlepeer-review

10 Scopus citations


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 languageEnglish (US)
Pages (from-to)279-282
Number of pages4
JournalDiscrete Mathematics
Issue number1-3
StatePublished - Dec 11 1992
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Directed triangles in directed graphs'. Together they form a unique fingerprint.

Cite this