Complex sentence: Seymour theorem (formerly Wagner's Conjecture) stating that families of graphs closed under the graph minor operation may be characterized by a finite set of forbidden minors.
Split into simpler sentences: Seymour theorem (formerly Wagner's Conjecture). This states that families of graphs closed under the graph minor operation may be characterized by a finite set of forbidden minors.