Abstract
Purchase PDF (1180 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (11)
Purchase PDF (430 K)
doi:10.1016/0097-3165(87)90029-X 
Copyright © 1987 Published by Elsevier Inc.
Chains, antichains, and fibres
Received 13 May 1986.
Communicated by Managing Editors
Available online 2 September 2004.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Call a subset of an ordered set a fibre if it meets every maximal antichain. We prove several instances of the conjecture that, in an ordered set P without splitting elements, there is a subset F such that both F and P − F are fibres. For example, this holds in every ordered set without splitting points and in which each chain has at most four elements. As it turns out several of our results can be cast more generally in the language of graphs from which we may derive “complementary” results about cutsets of ordered sets, that is, subsets which meet every maximal chain. One example is this: In a finite graph G every minimal transversal is independent if and only if G contains no path of length three.
