x_{1} and x_{2} are path-connected by ordered binary relation/predicate x_{3} (ka), such that all paths which satisfy condition(s) x_{4} (ka; default: no additional conditions) in the relevant graph (x_{5}) linking nodes by said relation x_{3} in a directed manner and which contain x_{1} must also (later in the path) contain x_{2}.

All paths in the graph that pass through x_{1} must at some point also pass through x_{2}. Note that they may also contain x_{2} earlier; for example, cycles do this. It just must be the case that any path which at some point comes from x_{1} via relation x_{3} must, at some later point, go to x_{2} (and then they may continue on); in other words, the web from x_{1} 'bunches' up at node x_{2} and no path from x_{1} does not eventually go to x_{2}. All other notes from ".utka" apply, although .utka_{4} is missing (and, thus, those notes are irrelevant), because it does not in general make sense to discuss intermediates nodes in this case (because no particular path is chosen). In a sense, this word captures the idea in the phrase "All roads lead to Rome", except that it would be rephrased as "All one-way roads from x_{1} lead to Rome". Diagrammatically, see: https://drive.google.com/file/d/14oSV_0ypJpIyKjEsOXVe684f6c-4jZBL/view?usp=drivesdk .
This word is intended to be equivalent to ".utkakpu", which accidentally has a separate entry in this dictionary.

- utka
- x
_{1}and x_{2}are path-linked by binary predicate x_{3}(ka) via intermediate steps x_{4}(ce'o; (ordered) list). - .utkakpu
- x
_{1}and x_{2}are path-connected by ordered binary relation/predicate x_{3}(ka), such that all paths which satisfy condition(s) x_{4}(ka; default: no additional conditions) in the relevant graph (x_{5}) linking nodes by said relation x_{3}in a directed manner and which contain x_{1}must also (later in the path) contain x_{2}.