Raphael Steiner, Congruence-constrained subdivisions in digraphs
Zoom ID: 869 4632 6610 (ibsdimag)I will present the short proof from that for every digraph F and every assignment of pairs of integers $(r_e,q_e)_{e\in A(F)}$ to its arcs, there exists an integer $N$ such that every digraph D with dichromatic number at least $N$ contains a subdivision of $F$ in which $e$ is subdivided into a directed path of …