Name
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. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1016/0012-365X(92)90719-V | Mathematics Preprint Archive |
Keywords | DocType | Volume |
pure_mathematics/0210031,discrete mathematics and combinatorics,discrete mathematics,directed graph | Journal | 2002 |
Issue | ISSN | Citations |
10 | Mathematics Preprint Archive | 4 |
PageRank | References | Authors |
1.18 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. de Graaf | 1 | 79 | 6.53 |
| A. Schrijver | 2 | 10 | 2.52 |
| P. D. Seymour | 3 | 297 | 32.84 |