An asymptotic formula for the maximum size of an h-family in products of partially ordered setsENGEL, K; KUZJURIN, N. N.Journal of combinatorial theory. Series A. 1984, Vol 37, Num 3, pp 337-347, issn 0097-3165Article

Strong properties in partially ordered sets IENGEL, K.Discrete mathematics. 1983, Vol 47, Num 2-3, pp 229-234, issn 0012-365XArticle

Monotonic functions on partially ordered setsBURKILL, H.Journal of combinatorial theory. Series A. 1984, Vol 37, Num 3, pp 248-256, issn 0097-3165Article

Some remarks on normalized matchingWEST, D. B; HARPER, L. W; DAYKIN, D. E et al.Journal of combinatorial theory. Series A. 1983, Vol 35, Num 3, pp 301-308, issn 0097-3165Article

A new proof of a theorem of harper on the Sperner-Erdös problemENGEL, K.Journal of combinatorial theory. Series A. 1985, Vol 39, Num 1, pp 19-24, issn 0097-3165Article

Strong properties in partially ordered sets IIENGEL, K.Discrete mathematics. 1984, Vol 48, Num 2-3, pp 187-196, issn 0012-365XArticle

An application of the Helly property to the partially ordered setsQUILLIOT, A.Journal of combinatorial theory. Series A. 1983, Vol 35, Num 2, pp 185-198, issn 0097-3165Article

On the size of maximal antichains and the number of pairwise disjoint maximal chainsHOWARD, David M; TROTTER, William T.Discrete mathematics. 2010, Vol 310, Num 21, pp 2890-2894, issn 0012-365X, 5 p.Article

Can transitive orientation make sandwich problems easier?HABIB, Michel; KELLY, David; LEBHAR, Emmanuelle et al.Discrete mathematics. 2007, Vol 307, Num 16, pp 2030-2041, issn 0012-365X, 12 p.Article

Semistandard tableaux associated with generalized labellings of posetsSILIMBANI, Matteo.Applied mathematics letters. 2006, Vol 19, Num 9, pp 865-872, issn 0893-9659, 8 p.Article

[2]×[3]×N is not a circle orderCHIANG LIN.Order (Dordrecht). 1991, Vol 8, Num 3, pp 243-246, issn 0167-8094Article

Multiplicative posetsSAUER, N. W; XUDING ZHU.Order (Dordrecht). 1991, Vol 8, Num 4, pp 349-358, issn 0167-8094Article

Random graph ordersALBERT, M. H; FRIEZE, A. M.Order (Dordrecht). 1989, Vol 6, Num 1, pp 19-30, issn 0167-8094, 12 p.Article

«Poly-unsaturated» posets: the Greene-Kleitman theorem is best possibleWEST, D. B.Journal of combinatorial theory. Series A. 1986, Vol 41, Num 1, pp 105-116, issn 0097-3165Article

Superantichains in the lattice of partitions of a setSHA JICHANG; KLEITMAN, D. J.Studies in applied mathematics (Cambridge). 1984, Vol 71, Num 3, pp 207-241, issn 0022-2526Article

A sperner-type theoremSALI, A.Order (Dordrecht). 1985, Vol 2, Num 2, pp 123-127, issn 0167-8094Article

Jensen's □ principles and the Novák number of partially ordered setsVELICKOVIC, B.The Journal of symbolic logic. 1986, Vol 51, Num 1, pp 47-58, issn 0022-4812Article

Some sequences associated with combinatorial structuresSAKS, M.Discrete mathematics. 1986, Vol 59, Num 1-2, pp 135-166, issn 0012-365XArticle

C.C.C. forcing without combinatoricsMEKLER, A. H.The Journal of symbolic logic. 1984, Vol 49, Num 3, pp 830-832, issn 0022-4812Article

A combinatorial approach to correlation inequalitiesBRIGHTWELL, Graham R; TROTTER, William T.Discrete mathematics. 2002, Vol 257, Num 2-3, pp 311-327, issn 0012-365X, 17 p.Article

A combinatorial bijection between linear extensions of equivalent ordersFAIGLE, U; SCHRADER, R.Discrete mathematics. 1986, Vol 58, Num 3, pp 295-301, issn 0012-365XArticle

A shellable poset that is not lexicographically shellableVINCE, A; WACHS, M.Combinatorica (Print). 1986, Vol 5, Num 3, pp 257-260, issn 0209-9683Article

Complete subgraphs of infinite multipartite graphs and antichains in partially oredered setsHAJNAL, A; SAUER, N.Discrete mathematics. 1986, Vol 59, Num 1-2, pp 61-67, issn 0012-365XArticle

Harmonics on posetsSTANTON, D.Journal of combinatorial theory. Series A. 1985, Vol 40, Num 1, pp 136-149, issn 0097-3165Article

On log concavity for order-preserving maps of partial ordersDAYKIN, D. E; DAYKIN, J. W; PATERSON, M. S et al.Discrete mathematics. 1984, Vol 50, Num 2-3, pp 221-226, issn 0012-365XArticle