Embedding simply connected 2-complexes in 3-space -- III. Constraint minors
Combinatorics
2017-09-15 v1
Abstract
We characterise the following property by six obstructions: given a graphic matroid and a set of its elements, when is the cycle matroid of a graph such that is a connected edge set in ?
Keywords
Cite
@article{arxiv.1709.04645,
title = {Embedding simply connected 2-complexes in 3-space -- III. Constraint minors},
author = {Johannes Carmesin},
journal= {arXiv preprint arXiv:1709.04645},
year = {2017}
}