Partitioning Boolean lattices into chains of subsets

Jerrold R. Griggs; Roger K. Yeh; Charles M. Grinstead

doi:10.1007/bf00346654

ScienceGate Book Chapters

JOURNAL ARTICLE

Partitioning Boolean lattices into chains of subsets

Jerrold R. Griggs Roger K. Yeh Charles M. Grinstead

Year: 1987 Journal: Order Vol: 4 (1)Pages: 65-67 Publisher: Springer Science+Business Media

DOI: 10.1007/bf00346654

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Combinatorics Complete Boolean algebra Lattice (music) Stone's representation theorem for Boolean algebras Set (abstract data type) Boolean algebra Two-element Boolean algebra Discrete mathematics Boolean function Boolean algebras canonically defined Algebra over a field Computer science Pure mathematics

Metrics

Cited By

1.03

FWCI (Field Weighted Citation Impact)

Refs

0.71

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Algebra and Logic

Physical Sciences → Computer Science → Computational Theory and Mathematics

semigroups and automata theory

Physical Sciences → Computer Science → Computational Theory and Mathematics

Advanced Topology and Set Theory

Physical Sciences → Mathematics → Geometry and Topology

Partitioning Boolean lattices into chains of subsets

Metrics

Citation History

Topics

Related Documents

Partitioning Boolean lattices into antichains

Partitioning bases of Boolean lattices

Chains in generalized Boolean lattices

Families of Subsets Without a Given Poset in Double Chains and Boolean Lattices

Partitioning the Boolean Lattice into Chains of Large Minimum Size