Mutually complementary partial orders

DOI10.1016/0012-365X(93)90506-OzbMath0771.06001MaRDI QIDQ2366008

Jason I. Brown, W. Stephen Watson

Publication date: 29 June 1993

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

zbMATH Keywords

largest set of pairwise complementary partial orders on a set of size \(n\); maximum number of mutually complementary \(T_ 0\) topologies on a set of size \(n\)

Mathematics Subject Classification ID

06A07: Combinatorics of partially ordered sets

54D10: Lower separation axioms ((T_0)--(T_3), etc.)

Related Items

The number of complements in the lattice of topologies on a fixed set, Partial order complementation graphs, Open problems in topology., The number of complements of a topology on \(n\) points is at least \(2^ n\) (except for some special cases)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Self complementary topologies and preorders
• The number of complements in the lattice of topologies on a fixed set
• On the number of open sets of finite topologies
• Finite topologies and Hamiltonian paths
• An extremal problem for finite topologies and distributive lattices
• On the Lattice of Topologies
• Mutually Complementary Families of T 1 Topologies, Equivalence Relations and Partial Orders
• The Lattice of Topologies: Structure and Complementation
• The Lattice of all Topologies is Complemented
• On the computer enumeration of finite topologies
• Multiple complementation in the lattice of topologies
• Infinite complementation in the lattice of topologies
• The Number of Finite Topologies
• Families of Mutually Complementary Topologies
• On the combination of topologies