Finite cutsets and finite antichains

DOI10.1007/BF00396272zbMATH Open0559.06002WikidataQ71385567 ScholiaQ71385567MaRDI QIDQ802580FDOQ802580

Norbert Sauer, R. E. Woodrow

Publication date: 1984

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

antichainscutsetswidthmaximal chainsconditionally chain complete

Mathematics Subject Classification ID

Partial orders, general (06A06)

Cites Work

• A decomposition theorem for partially ordered sets
• Compact Spaces and Spaces of Maximal Complete Subgraphs
• Antichains and Finite Sets that Meet all Maximal Chains

Cited In (21)

• A chain decomposition theorem
• Infinite ordered sets spanned by finitely many chains
• Minimum cutsets for an element of a Boolean lattice
• On the n-cutset property
• Cutsets and anti-chains in linear lattices
• A minimal cutset of the Boolean lattice with almost all members
• Cut-sets in infinite graphs and partial orders
• Cutsets of Boolean lattices
• Extensions of ordered sets having the finite cutset property
• Maximal chains and cutsets of an ordered set: A Menger type approach
• Antichain cutsets
• On the dimension of ordered sets with the 2-cutset property
• Title not available (Why is that?)
• Cores, cutsets and the fixed point property
• Compactness and subsets of ordered sets that meet all maximal chains
• Title not available (Why is that?)
• Lattices of crosscuts
• Wide posets with fixed height and cutset number
• Chains, antichains, and fibres
• A length-width inequality for partially ordered sets with two-element cutsets
• Ladders in ordered sets

This page was built for publication: Finite cutsets and finite antichains

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