minor
Number of Cliques in Minor-Closed Classes ★★
Author(s): Wood
Question Is there a constant such that every -vertex -minor-free graph has at most cliques?
Seagull problem ★★★
Author(s): Seymour
Conjecture Every vertex graph with no independent set of size has a complete graph on vertices as a minor.
Keywords: coloring; complete graph; minor
Seymour's self-minor conjecture ★★★
Author(s): Seymour
Conjecture Every infinite graph is a proper minor of itself.
Keywords: infinite graph; minor
Consecutive non-orientable embedding obstructions ★★★
Author(s):
Conjecture Is there a graph that is a minor-minimal obstruction for two non-orientable surfaces?
Highly connected graphs with no K_n minor ★★★
Author(s): Thomas
Problem Is it true for all , that every sufficiently large -connected graph without a minor has a set of vertices whose deletion results in a planar graph?
Keywords: connectivity; minor