On cycles of maximum length in bipartite digraphs
Speake: Ngo Dac Tan

Time: 9h30, Thursday, February 23, 2017

Location: Room 201, Vien Toan hoc, 18 Hoang Quoc Viet

Abtract: There are numerous sufficient conditions for the existence of a Hamilton cycle in digraphs such that the Dirac- and Ore-type conditions that due Nash-William, Woodal, Meyniel,...But similar conditions for bipartite digraphs are relatively little known in literature. In this talk, we present the Ore-type conditions for the existence of a cycle of maximum length in bipartite digraphs suggested by J. Adamus and L. Adamus.