Browsing Waterloo Research by Subject "bipartite digraph"
Now showing items 1-1 of 1
-
Short Directed Cycles in Bipartite Digraphs
(Springer Nature, 2020-08-01)The Caccetta-Häggkvist conjecture implies that for every integer k ≥ 1, if G is a bipartite digraph, with n vertices in each part, and every vertex has out-degree more than n/(k+1), then G has a directed cycle of length ...