S. Fomin, Generalizations of the Greene--Kleitman theorem, Discrete Math. 157 (1996) 376--377. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Wide Partitions, Latin Tableaux, and Rota's Basis Conjecture - Chow, Fan, Goemans, Vondrak (2002) (Correct)
....sizes. We also show that certain graphs arising from wide partitions satisfy a property called conjugacy, which Greene and Kleitman famously showed was true of comparability graphs. This result seems interesting in its own right, because graphs satisfying conjugacy are rather hard to come by [5], and our examples seem to be new. Finally, we show that to prove the WPC for free matroids, it suces to consider self conjugate shapes. 2 Basic de nitions We follow [16] for most of our notation and terminology for (integer) partitions, but the reader should note two important exceptions. ....
S. Fomin. Generalizations of the Greene-Kleitman theorem. Discrete Math., 157:376{ 377, 1996. 26
Wide partitions, Latin tableaux, and Rota's basis conjecture - Chow, Fan, Goemans, Vondrak (2003) (Correct)
No context found.
S. Fomin, Generalizations of the Greene--Kleitman theorem, Discrete Math. 157 (1996) 376--377.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC