Isometric copies of directed trees in orientations of graphs

Taras Banakh, Adam Idzik, Oleg Pikhurko +2

For every $n\in \mathbb{N}$ we construct a finite graph $G$ such that every orientation $\vec{G}$ of $G$ contains an isometric copy of any oriented tree on $n$ vertices, and evaluate…