Counting Unlabelled Topologies and Transitive Relations
Counting Unlabelled Topologies and Transitive Relations
Summary: We enumerate isomorphism classes of several types of transitive relations (equivalently, finite topologies) up to 15 or 16 points.
- Australian National University Australia
Keywords: Computational methods, Directed graph, Directed graphs (digraphs), tournaments, transitive relations, Ordered sets, finite topologies, Enumeration in graph theory, Graph, Graph theory, Number theory, Finite topology, Order, Set theory, isomorphism classes, Theorem proving, Transitive relation, Topology Directed graph
Keywords: Computational methods, Directed graph, Directed graphs (digraphs), tournaments, transitive relations, Ordered sets, finite topologies, Enumeration in graph theory, Graph, Graph theory, Number theory, Finite topology, Order, Set theory, isomorphism classes, Theorem proving, Transitive relation, Topology Directed graph
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!