Yanitsa Pehova - “An approximate version of Jackson’s conjecture“ | MoCCA’20

The talk “An approximate version of Jackson’s conjecture“ by Yanitsa Pehova on the Moscow Conference on Combinatorics and Applications at MIPT. Annotation: In 1981 Jackson showed that the diregular bipartite tournament (a complete balanced bipartite graph whose edges are oriented so that every vertex has the same in- and outdegree) contains a Hamilton cycle, and conjectured that in fact the edge set of it can be partitioned into Hamilton cycles. We give two approximate versions of this conjecture, and discuss some open problems in the area. The full schedule of the conference -