On the computer enumeration of finite topologies

DOI10.1145/363282.363311zbMATH Open0166.01003OpenAlexW2003230391MaRDI QIDQ5552182FDOQ5552182

Authors:

Publication date: 1967

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/363282.363311

zbMATH Keywords

combinatorics

Cited In (38)

• Finite fuzzy topological spaces
• The number of labelled topologies on nine points
• Number of labeled topologies on ten points
• On the enumeration of finite topologies
• Properties of distance spaces with power triangle inequalities
• Struktur- und Anzahlformeln für Topologien auf endlichen Mengen
• Combinatorial properties of binary semigroups
• Properties of topological spaces associated with sigraphs
• On support sets of acyclic and transitive digraphs
• The number of complements of a topology on \(n\) points is at least \(2^ n\) (except for some special cases)
• Counting finite posets and topologies
• Counting of finite topologies and a dissection of Stirling numbers of the second kind
• Birational equivalence of reduced graphs
• Topologies on the \(n\)-element set consistent with topologies close to discrete on an \((n -1)\)-element set
• Properties of 2-CNF mutually dual and self-dual T_0 -topologies on a finite set and calculation of T_0-topologies of a certain weight
• On the number of transitive digraphs with n labeled vertices and k arcs
• Homologies of transitive digraphs and discrete spaces;Гомологии транзитивных орграфов и дискретных пространств
• Title not available (Why is that?)
• Computer programing for construction and enumeration of all regular topologies and equivalence relations on finite sets
• Partial order complementation graphs
• Regular rings and distributive lattices
• The Number of Finite Topologies
• Periodicity of residues of the number of finite labeled topologies
• New results from an algorithm for counting posets
• Self complementary topologies and preorders
• On DG-topological spaces associated with directed graphs
• On some formulas in the problem of enumeration of finite labeled topologies
• On the cardinalities of finite topologies and the number of antichains in partially ordered sets
• A note on some generalized closed sets in bitopological spaces associated to digraphs
• Mutually complementary partial orders
• On the spectrum and number of convex sets in graphs
• The independent compatible edges topology of directed graphs
• Asymptotic Enumeration of Partial Orders on a Finite Set
• On recursion relations in the problem of enumeration of posets
• The number of weak orders. A comment
• On the cardinality of the \(T_0\)-topologies on a finite set
• Solving computational tasks on finite topologies by means of relation algebra and the \textsc{RelView} tool
• On recurrence relation in the problem of enumeration of finite posets

This page was built for publication: On the computer enumeration of finite topologies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5552182)