Vertices may be partitioned into two sets such that no two vertices in the same set are connected versus not so.
Vertices may be partitioned into two sets such that no two vertices in the same set are connects versus not so.
Left examples are called "bipartite graphs."
Aaron David Fairbanks
Bongard Problems with world "concept" MBPs vs. other Bongard Problems.