An inequality for the sizes of prime filters of finite distributive lattices

DOI10.1016/S0012-365X(98)00313-6zbMath0937.06004OpenAlexW2063023801MaRDI QIDQ1301731

Dwight Duffus, Bill Sands

Publication date: 1 June 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00313-6

zbMATH Keywords

finite distributive latticejoin-irreducible elementprime filterFrankl's conjecturefinite non-Boolean lattice

Mathematics Subject Classification ID

Structure and representation theory of distributive lattices (06D05) Structure theory of lattices (06B05)

Related Items (3)

The journey of the union-closed sets conjecture ⋮ On the scope of averaging for Frankl's conjecture ⋮ Well-graded families and the union-closed sets conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Every poset has a central element
• Counting antichains in finite partially ordered sets
• Union-closed families
• Density of union-closed families
• Frankl's conjecture is true for modular lattices
• Which mean do you mean?
• A graph-theoretic version of the union-closed sets conjecture
• A Cubic Counterpart of Jacobi's Identity and the AGM

This page was built for publication: An inequality for the sizes of prime filters of finite distributive lattices