Every poset has a central element
- 1 November 1985
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 40 (2) , 195-210
- https://doi.org/10.1016/0097-3165(85)90087-1
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Searching ordered structuresJournal of Algorithms, 1985
- The Information-Theoretic Bound is Good for MergingSIAM Journal on Computing, 1984
- Counting antichains in finite partially ordered setsDiscrete Mathematics, 1981
- Information Bounds Are Weak in the Shortest Distance ProblemJournal of the ACM, 1980
- An inequality for the weights of two families of sets, their unions and intersectionsProbability Theory and Related Fields, 1978
- How good is the information theory bound in sorting?Theoretical Computer Science, 1976
- Correlation inequalities on some partially ordered setsCommunications in Mathematical Physics, 1971