For instance, Wagner's theorem states that the planar graphs are the graphs that have neither the complete graph  nor the complete bipartite graph  as minors.
To illustrate, Wagner's theorem indicates that a graph is considered planar if it does not contain the complete graph or the complete bipartite graph as a minor.