Rado's Selection Principle is a combinatorial theorem which allows the characterization of infinite objects (e.g. graphs, groups, partially-ordered sets) based on the characterization of their finite subparts. That is, a ...