34 citations · 188 across the 74 of their papers we have counts for
Showing 2012 · math.COShow all
2 papers · 2 filters
math.CO2012★ 3 cited
Counting paths in digraphs
Paul Seymour, Blair D. Sullivan
Say a digraph is k-free if it has no directed cycles of length at most k, for positive integers k. Thomasse conjectured that the number of induced 3-vertex directed paths in a simp…
math.CO2012
Tournament Minors
Ilhee Kim, Paul Seymour
We say a digraph is a {\em minor} of a digraph if can be obtained from a subdigraph of by repeatedly contracting a strongly-connected subdigraph to a vertex. Here,…