# Combinatorial Objects

Permutations, subsets, and set partitions are combinatorial objects are both useful in describing properties of graphs and objects with interesting properties of their own. One distinguishing property of combinatorial objects is that there are a finite number of them of any given size, and that a lexicographic order can be defined on them. Thus they can be ranked and unranked, and constructed at random.