From the 1 of 10 linked papers with an AI index.
1 paper · 1 filter
David V. Feldman, Alexander Wilce
Say that a topological space X has finite, respectively bounded, cliques iff every closed, irreflexive binary relation --- equivalently, every closed, loop-free directed graph --…