Containment hierarchy
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Containment_hierarchy"
.

A containment hierarchy is a hierarchical collection of strictly nested sets. Each entry in the hierarchy designates a set such that the previous entry is a strict superset, and the next entry is a strict subset. For example, all rectangles are quadrilaterals, but not all quadrilaterals are rectangles, and all squares are rectangles, but not all rectangles are squares. A hierarchy of this kind is to be contrasted with a more general notion of a partially ordered set.

A taxonomy is a classic example of a containment hierarchy:

See also

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.
content
© jGames.co.uk 2007 (some content from Wikipedia under GDL ) !-- ValueClick Media 468x60 and 728x90 Banner CODE for jgames.co.uk -->
Your Ad Here