Dilworth's Lemma

The Width of a set is equal to the minimum number of Chains neededto Cover . Equivalently, if a set of elements is Partially Ordered,then contains a Chain of size or an Antichain of size . Letting be theCardinality of , the Width, and the Length, this last statement says . Dilworth's lemma is a generalization of the Erdös-SzekeresTheorem. Ramsey's Theorem generalizes Dilworth's lemma.

• Small Stellated Truncated Dodecahedron
• Small Triakis Octahedron
• Small Triambic Icosahedron
• Small World Problem
• Smarandache Ceil Function
• Smarandache Constants
• Smarandache Function
• Smarandache-Kurepa Function
• Smarandache Near-to-Primorial Function
• Smarandache Paradox
• Smarandache Sequences
• Smarandache-Wagstaff Function
• Smith Brothers
• Smith Conjecture
• Smith Normal Form
• Smith Number
• Smith's Markov Process Theorem
• Smith's Network Theorem
• Smooth Manifold
• Smooth Number
• Smooth Surface
• Snake
• Snake Eyes
• Snake Oil Method
• Snake Polyiamond