On the cardinalities of finite topologies and the number of antichains in partially ordered sets

DOI10.1016/0012-365X(81)90202-8zbMATH Open0465.05009MaRDI QIDQ1154468FDOQ1154468

Authors: Marcel Erné 

Publication date: 1981

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorial identities, bijective combinatorics (05A19) Lower separation axioms ((T_0)--(T_3), etc.) (54D10)

Cites Work

• Asymptotic Enumeration of Partial Orders on a Finite Set
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the computer enumeration of finite topologies
• Struktur- und Anzahlformeln für Topologien auf endlichen Mengen
• A Machine Representation of Finite T ₀ Topologies
• Title not available (Why is that?)
• On the number of open sets of finite topologies
• On the cardinalities of finite topologies
• Quasi-Orderings and Topologies on Finite Sets

Cited In (10)

• Obtainable sizes of topologies on finite sets
• Title not available (Why is that?)
• Chains in lattices of mappings and finite fuzzy topological spaces
• On the number of reachable pairs in a digraph
• Riordan posets and associated incidence matrices
• Counting finite posets and topologies
• New results from an algorithm for counting posets
• A generalization of a theorem of Erné about the number of posets with a fixed antichain
• A framework for the systematic determination of the posets on \(n\) points with at least \(\tau \cdot 2^n\) downsets
• Some recurrence relations in finite topologies

This page was built for publication: On the cardinalities of finite topologies and the number of antichains in partially ordered sets

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