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)|
|Number of pages||4|
|State||Published - Dec 11 1992|
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics