x_{1} and x_{2} are path-linked by binary predicate x_{3} (ka) via intermediate steps x_{4} (ce'o; (ordered) list).

For example, "lo stedu ku utka lo birka lo ka (ce'u ce'u) lamji" is true, with x_{4} equal to something like "lo cnebo ce'o lo cutne ce'o lo janco". (Also: "lo stedu ku lamji'utka lo birka".) Formally, "utka(A, B, P, [L_{1...L}])" is equivalent to "P(A, L_{1)} and P(L_{1, L} and ... and P(L_{(n-1), L} and P(L_{n, B)}". The x_{4} may be empty ("lo nomei") if there are no intermediate steps (id est: the relevant path-linking between x_{1} and x_{2} is direct). x_{4} is a list of only the intermediate steps between x_{1} and x_{2} and does not include x_{1} or x_{2} themselves; it is ordered so that the relevant relation (x_{3}) holds between x_{1} and the first term/entry of the list (in that order), between each successive pair of consecutive terms/entries of the list (in the order in which they are listed), and between the last term/entry of the list and x_{2} (in that order). x_{4} may not be unique. x_{3} may not be symmetric (commutative) under exchange of its operands. The predicate may be asymmetrical. See also: ".efku", "ki'irsi", ".utka'au", "takni", "taknyklojyzilpra". See ".utkaro" and ".utkakpu" for somewhat stronger conditions.

- jatny'utka
- x
_{1}is the captain/commander/leader/boss/superior of/to the captain/commander/leader/boss/superior of/to the captain/commander/leader/boss/superior of/to the ... captain/commander/leader/boss/superior of/to x_{2}(subject, entity, vehicle, domain), connected by intermediate steps x_{3}. - mindy'utka
- x
_{1}directly or indirectly commands x_{2}, via intermediaries x_{3}(ce'o; ordered list), for result x_{4}(event) to occur. - pafy'utka
- x
_{1}is patrilineal/agnatic to/an agnate of x_{2}; x_{1}is path-connected to x_{2}via the fatherhood relation, connected by a graph-path passing through intermediate relations/steps (successive agnates) x_{3}(ce'o; ordered list). - pavmompazy'utka'au'ypanzi
- x
_{1}is any child of the first child of the first child of ... the first child of x_{2}, where the graph geodesic through the ancestorship-directed family tree from x_{1}to x_{2}is of length (x_{3) + 1}(li; x_{3}must be a nonnegative integer or positive infinity), and where "first" is according to (partial) ordering rule x_{4}(default: chronological order of birth per successive generation within the given lineage; other restrictions on legitimacy etc. may be specified here as well). - pedy'utka
- x
_{1}is a friend of a friend of ... a friend of x_{2}(experiencer), path-connected by the directed friendship relationship via intermediate nodes (friends) x_{3}(list; ce'o). - pendy'utka
- x
_{1}is a friend of a friend of ... a friend of x_{2}(experiencer), path-connected by the directed friendship relationship via intermediate nodes (friends) x_{3}(list; ce'o). - sity'utka
- x
_{1 }= sitna_{1 }= .utka_{1}cites/quotes/refers to/makes reference to a source, which itself/who themself cites/quotes/refers to/makes reference to a source, which itself/who themself in turn cites/quotes/refers to/makes reference to source, ..., which itself/who themself cites/quotes/refers to/makes reference to source x_{2 }= sitna_{2 }= .utka_{2}, via intermediate path-connecting steps x_{3 }= .utka_{3}(ordered list; ce'o), all for the same information/statement x_{4 }= sitna_{3}(du'u). - lamji'utka
- x
_{1}is directly or indirectly touching x_{2}via intermediate steps x_{3}(ce'o list); x_{1}and x_{2}belong to the same connected component. - utka'au
- x
_{1}and x_{2}are path-linked by binary predicate x_{3}(ka; possibly non-symmetric/non-commutative) via a from-x_{1}-to-x_{2}-directed graph geodesic of length x_{4}(li; nonnegative integer or positive infinity). - .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}. - 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}. - utkaro
- x
_{1}and x_{2}are path-linked by directed binary predicate x_{3}(ka) via intermediate steps x_{4}(ordered list; ce'o), such that no other node exists in the graph (x_{5}) to which x_{2}is connected in the same way/direction.