Antichains and Finite Sets that Meet all Maximal Chains

DOI10.4153/CJM-1986-031-3zbMath0606.06001OpenAlexW2322183000MaRDI QIDQ3744207

Bill Sands, Ivan Rival, John Ginsburg

Publication date: 1986

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1986-031-3

zbMATH Keywords

cellularitymaximal chainschain complete ordered setuncountable antichainfinite cutset property

Mathematics Subject Classification ID

Partial orders, general (06A06) Topological lattices (06B30) Cellularity in topological manifolds (57N60)

Related Items (17)

Ladders in ordered sets ⋮ Cutsets of Boolean lattices ⋮ Antichain cutsets of strongly connected posets ⋮ Chains, antichains, and fibres ⋮ A chain decomposition theorem ⋮ Maximal chains and cutsets of an ordered set: A Menger type approach ⋮ A length-width inequality for partially ordered sets with two-element cutsets ⋮ Cut-sets in infinite graphs and partial orders ⋮ A minimal cutset of the Boolean lattice with almost all members ⋮ On the n-cutset property ⋮ Minimum cutsets for an element of a Boolean lattice ⋮ Compact Spaces and Spaces of Maximal Complete Subgraphs ⋮ Compactness and subsets of ordered sets that meet all maximal chains ⋮ Obituary: Ivan Rival ⋮ On the dimension of ordered sets with the 2-cutset property ⋮ Finite cutsets and finite antichains ⋮ Wide posets with fixed height and cutset number

This page was built for publication: Antichains and Finite Sets that Meet all Maximal Chains