An extremal problem for finite topologies and distributive lattices
From MaRDI portal
Publication:2556878
DOI10.1016/0097-3165(73)90022-8zbMath0251.06019OpenAlexW2151082726MaRDI QIDQ2556878
Publication date: 1973
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(73)90022-8
Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial inequalities (05A20) Structure and representation theory of distributive lattices (06D05)
Related Items (5)
Mutually complementary partial orders ⋮ The number of complements of a topology on \(n\) points is at least \(2^ n\) (except for some special cases) ⋮ Self complementary topologies and preorders ⋮ Obtainable sizes of topologies on finite sets ⋮ On the cardinalities of finite topologies
Cites Work
This page was built for publication: An extremal problem for finite topologies and distributive lattices