nLab dense directed loop graph

Contents

Contents

 Definition

A directed loop graph is dense if for every pair of vertices a:Va:V and b:Vb:V with an edge aba \to b, there exists a vertex c:Vc:V with edges aca \to c and cbc \to b.

A binary endorelation is dense if it is the edge relation of a dense directed loop graph.

See also

References

See also:

Last revised on May 31, 2022 at 15:48:25. See the history of this page for a list of all contributions to it.