Greene-kleitman Theorem
The Greene-Kleitman Theorem is a fundamental result in algebraic combinatorics that establishes a precise relationship between the shape of a Young tableau and the maximum size of a union of k disjoint increasing subsequences in a permutation, by equating it to the sum of the first k parts of the associated partition via the Robinson-Schensted correspondence.
24
Publications
1.2K
Citations
42
Authors
34
Institutions
Publications per year
2017–2026
4
Parents
24
Daniel J. Kleitman, Ian Anderson · American Mathematical Monthly · 1989 · 478 citations
THE CARUS MATHEMATICAL MONOGRAPHS
H. E. Slaught · School Science and Mathematics · 1925 · 178 citations
1–5 of 24
42
2 publications · 204 citations
2
h-index
2
h-index
1
h-index
1
h-index
Instituto Venezolano de Investigaciones Científicas, Venezuela
1 publications · 10 citations
1
h-index
1–5 of 42
34
Fuyang Normal University
Fuyang, China
1 h-index
1 publications
14 citations

Hasselt University
Hasselt, Belgium
1 h-index
2 publications
60 citations

Bar-Ilan University
Ramat Gan, Israel
1 h-index
1 publications
16 citations

Santa Clara University
Santa Clara, United States
1 h-index
2 publications
100 citations
Universidad Antonio Nariño
Bogotá, Colombia
1 h-index
1 publications
10 citations

Romanian Academy
Bucharest, Romania
1 h-index
3 publications
72 citations
University of Graz
Graz, Austria
1 h-index
1 publications
22 citations
Jagiellonian University
Krakow, Poland
1 h-index
1 publications
24 citations
1–8 of 34
5 publications · 583 citations
5
h-index
1 publications · 12 citations
1
h-index
1 publications · 58 citations
1
h-index
1 publications · 47 citations
1
h-index
1 publications · 24 citations
1
h-index
1–5