New answers tagged graph-minors
3
votes
Forbidden minor characterization of polytope skeletons
For $d \geq 4$ what you describe are all graphs. The 1-skeleton of Cyclic polytopes is $K_n$ for $d\geq 4$.
Top 50 recent answers are included
Related Tags
graph-minors × 87graph-theory × 80
co.combinatorics × 40
graph-colorings × 11
reference-request × 9
hadwiger-conjecture × 8
infinite-combinatorics × 7
set-theory × 4
algorithms × 4
trees × 4
hypergraph × 3
extremal-graph-theory × 3
topological-graph-theory × 3
planar-graphs × 3
linear-algebra × 2
matrices × 2
computational-complexity × 2
order-theory × 2
combinatorial-optimization × 2
matroid-theory × 2
directed-graphs × 2
knot-link × 2
at.algebraic-topology × 1
rt.representation-theory × 1
lo.logic × 1