Maximum antichains of rectangular arrays

DOI10.1016/0097-3165(79)90035-9zbMath0422.05018OpenAlexW1992495273MaRDI QIDQ1133543

G. W. Peck

Publication date: 1979

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(79)90035-9

zbMATH Keywords

parallelepipedmaximum antichainsrectangular arraysinteger corner points

Mathematics Subject Classification ID

Partial orders, general (06A06) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (5)

Semiantichains and Unichain Coverings in Direct Products of Partial Orders ⋮ A Sperner theorem for the interval order of a projective geometry ⋮ The global theory of flows in networks ⋮ Parenthesizations of finite distributive lattices ⋮ Morphisms for the strong Sperner property of Stanley and Griggs

Cites Work

• Unnamed Item
• Unnamed Item
• Application of the Berry-Esseen inequality to combinatorial estimates
• The morphology of partially ordered sets
• On a problem of Rota
• Restricted growth functions and incidence relations of the lattice of partitions of an n-set
• Skew chain orders and sets of rectangles
• On Rota's problem concerning partitions
• Maximal sized antichains in partial orders
• On the Location of the Maximum Stirling Number(s) of the Second Kind
• Combinatorial Structure of the Faces of then-Cube
• Some Results on Matching in Bipartite Graphs

This page was built for publication: Maximum antichains of rectangular arrays