Recently I heard someone talking about a general result saying that a graph property satisfying certain conditions always is characterizable via a (finite) set of 'smallest examples' (similar to the famous characterization of non-planar graphs as those that contain either the complete 5-graph or the 3-3 graph).
Does anyone recognize what I'm talking about? Where can I find more details on this?