Dilworth's Theorem
Dilworth's Theorem is a fundamental result in order theory stating that in any finite partially ordered set, the size of a maximum antichain equals the minimum number of chains needed to partition the set.
52
Publications
2.5K
Citations
96
Authors
48
Institutions
Publications per year
2017–2026
1
Parents
52
Four classes of perfectly orderable graphs
Vašek Chvátal, Chı́nh T. Hoàng, N. V. R. Mahadev et al. · Journal of Graph Theory · 1987 · 127 citations
Imaging through scattering media with holography
E. Leith, C. Chen, Houshou Chen et al. · Journal of the Optical Society of America A · 1992 · 125 citations
Natural Sciences, Biomedical Engineering, Biomedical Imaging +12
1–5 of 52
96
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 96
48

Vanderbilt University
Nashville, United States
3 h-index
5 publications
665 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
3 h-index
3 publications
168 citations
Hebrew University of Jerusalem
Jerusalem, Israel
2 h-index
2 publications
119 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
2 publications
48 citations
Translational Innovation in Medicine and Complexity
Grenoble, France
2 h-index
2 publications
41 citations
Nagoya University
Nagoya, Japan
2 h-index
2 publications
56 citations

University of Manitoba
Winnipeg, Canada
2 h-index
4 publications
60 citations

Hungarian Academy of Sciences
Budapest, Hungary
2 h-index
4 publications
156 citations
1–8 of 48
5 publications · 160 citations
5
h-index
PROC · 4 publications · 190 citations
4
h-index
3 publications · 120 citations
3
h-index
3 publications · 194 citations
3
h-index
IJAC · 3 publications · 449 citations
3
h-index
1–5