Rel, bicategory of relations, allegory
left and right euclidean;
extensional, well-founded relations.
A directed loop graph is dense if for every pair of vertices $a:V$ and $b:V$ with an edge $a \to b$, there exists a vertex $c:V$ with edges $a \to c$ and $c \to b$.
A binary endorelation is dense if it is the edge relation of a dense directed loop graph.
See also:
Last revised on May 31, 2022 at 11:48:25. See the history of this page for a list of all contributions to it.