Publication:3483322

DOI10.1137/0403017zbMATH Open0704.06001OpenAlexW2016965032MaRDI QIDQ3483322FDOQ3483322

Bill Sands, Peter Winkler, Dwight Duffus

Publication date: 1990

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

Full work available at URL: https://semanticscholar.org/paper/558db5223b731c4ed0584505c16409a7a664e29e

zbMATH Keywords

fibremaximal chainsBoolean latticecutsetmaximal antichains

Mathematics Subject Classification ID

Partial orders, general (06A06) Structure theory of Boolean algebras (06E05)

Cited In (22)

• Fibres and ordered set coloring
• Title not available (Why is that?)
• Minimum sized fibres in distributive lattices
• Optimal Sets of Questions for Twenty Questions
• Subgraph transversal of graphs
• On the size of maximal chains and the number of pairwise disjoint maximal antichains
• On the \(f\)-vectors of cutsets in the Boolean lattice
• Minimum cutsets for an element of a Boolean lattice
• On the number of maximal antichains in Boolean lattices for \(n\) up to 7
• Cutsets and anti-chains in linear lattices
• Boolean layer cakes
• Posets in which every cutset meets every fibre
• Maximal chains and cutsets of an ordered set: A Menger type approach
• Antichains and completely separating systems -- a catalogue and applications
• On Intersecting Chains in Boolean Algebras
• Every cutset meets every fibre in certain poset products
• Packing and covering k-chain free subsets in Boolean lattices
• Multicolor chain avoidance in the Boolean lattice
• A note on maximal antichains in ordered sets
• Edge‐cutsets in the directed hypercube
• Title not available (Why is that?)
• Venn diagrams and symmetric chain decompositions in the Boolean lattice

This page was built for publication: Maximal Chains and Antichains in Boolean Lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3483322)