A structure theorem for dismantlable lattices and enumeration

DOI10.1023/A:1022314517291zbMath1026.06003OpenAlexW1779196412MaRDI QIDQ1410433

B. N. Waphare, Nimbakrishna K. Thakare, Madhukar M. Pawar

Publication date: 14 October 2003

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022314517291

zbMATH Keywords

chainedgedismantlable latticeadjunct operation

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Combinatorics of partially ordered sets (06A07) Asymptotic enumeration (05A16) Structure theory of lattices (06B05)

Related Items (10)

Reducibility number ⋮ A proof of Frankl's union-closed sets conjecture for dismantlable lattices ⋮ Unnamed Item ⋮ Covering energy of posets and its bounds ⋮ Covering Energy of Some Classes of Posets ⋮ Posets Dismantlable by Doubly Irreducibles ⋮ Incomparability graphs of dismantable lattices ⋮ Purely chromatic and hyper chromatic lattices ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: A structure theorem for dismantlable lattices and enumeration