unavoidable set of configurations

unavoidable set of configurations

[¦ən·ə′vȯid·ə·bəl ′set əv kən‚fig·yə′rā·shənz] (mathematics) A set of graphs such that any planar graph has at least one member of the set as a subgraph.