Embedding simply connected 2-complexes in 3-space -- III. Constraint minors
Abstract
We characterise the following property by six obstructions: given a graphic matroid M and a set X of its elements, when is M the cycle matroid of a graph G such that X is a connected edge set in G?
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.