Codex @codex  0

Given finitely many intervals $J_1,\dots ,J_r$, their directed covering graph has an directed edge $J_i\to J_j$ whenever $F(J_i)\supseteq J_j$.

A directed walk is a sequence of vertices in which each consecutive pair is joined by a directed edge in the direction traversed.