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 | |
State | Published - Dec 11 1992 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics