Partial order complementation graphs

DOI10.1007/BF02115814zbMath0814.06005OpenAlexW1978617937MaRDI QIDQ1344245

Jason I. Brown, W. Stephen Watson

Publication date: 13 June 1995

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02115814

zbMATH Keywords

complementationfinite topologypartial orders

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorics of partially ordered sets (06A07) Several topologies on one set (change of topology, comparison of topologies, lattices of topologies) (54A10)

Related Items (3)

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

Cites Work

• The computational complexity of asymptotic problems. I: Partial orders
• Self complementary topologies and preorders
• The number of complements in the lattice of topologies on a fixed set
• Mutually complementary partial orders
• Finite topologies and Hamiltonian paths
• Struktur- und Anzahlformeln für Topologien auf endlichen Mengen
• On the Lattice of Topologies
• Asymptotic Enumeration of Partial Orders on a Finite Set
• 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
• Families of Mutually Complementary Topologies
• On the combination of topologies
• Unnamed Item
• Unnamed Item

This page was built for publication: Partial order complementation graphs