| New Reply |
Combinatorics/graph theory: Digraphs and cycles |
Share Thread | Thread Tools |
| Jan9-13, 12:38 PM | #1 |
|
|
Combinatorics/graph theory: Digraphs and cycles
Hi,
How would you go about proving the following statement? Let k:= ∂+(D) with k≥ 1. Then D contains a cycle of length at least k+1. ∂+(D) is the minimum out degree of any vertex in digraph D. Thanks a lot, Will |
| New Reply |
| Thread Tools | |
Similar Threads for: Combinatorics/graph theory: Digraphs and cycles
|
||||
| Thread | Forum | Replies | ||
| Graph theory: Existence of cycles | Calculus & Beyond Homework | 0 | ||
| Combinatorics(Graph Theory) | Calculus & Beyond Homework | 0 | ||
| General Help for Combinatorics and Graph Theory | General Math | 5 | ||
| Cycles in a number-theoretic graph... | Brain Teasers | 1 | ||
| number of cycles in a graph ??? | Programming & Comp Sci | 0 | ||
Physorg.com Science News Partner
