Key points are not available for this paper at this time.
We consider an h-partite version of Dilworth’s theorem with multiple partial orders. Let P be a finite set, and let n 1−γ(α), where γ(α) → 0 as α → 1. We provide a few applications of these results in combinatorial geometry, as well.
Building similarity graph...
Analyzing shared references across papers
Loading...
István Tomon (Tue,) studied this question.
www.synapsesocial.com/papers/69f933e643e50b5d109de116 — DOI: https://doi.org/10.1007/s11083-015-9384-6
István Tomon
Order
University of Cambridge
Building similarity graph...
Analyzing shared references across papers
Loading...