9 problems
For every integer and every -vertex graph with independence number , the graph contains as an odd minor.
Let denote the bicircular matroid of a graph , let be the uniform matroid of rank on elements, and let and be respectively the g…
Let be the -element rank- uniform matroid, and more generally let be the -element rank- uniform matroid. Let be the graphic matroid of the…
Let . A graph is a forbidden minor for -flattenability when it is a minimal obstruction to -flattenability. For an edge of a graph , deno…
Let be a graph, let be a nonedge of , and let denote the graph obtained by adding . An atom of is a graph-theoretic atom containing , and an…
DeVos–Kwon–Oum's branch-depth obstruction conjecture. For every positive integer , there is an integer such that every matroid of branch-depth at least contains a minor…
Let be a signed bipartite graph, with unbalanced girth at least , that has no -minor. The signed projective cube is the signed graph on v…
Bounded geodecity conjecture. For every graph there exists an integer such that every subdivision of lies in \H_m.
Let be a positive integer, and let be a -connected clonal matroid. The matroids and are uniform matroids, while and denot…