Tournaments
| Title | Source | Status | Imp. | Posted |
|---|---|---|---|---|
| Decomposing an even tournament in directed paths. | opg | partial | ★★★ | 2013-02-26 |
| Monochromatic reachability or rainbow triangles | opg | partial | ★★★ | 2008-07-15 |
| Decomposing k-arc-strong tournament into k spanning strong digraphs | opg | partial | ★★ | 2013-03-15 |
| Edge-disjoint Hamilton cycles in highly strongly connected tournaments. | opg | solved | ★★ | 2013-03-08 |
| Partitionning a tournament into k-strongly connected subtournaments. | opg | solved | ★★ | 2013-03-15 |