6 problems
- 0 votes0 replies1 view
Van Kampen obstruction criterion for simplicial maps of trees
Van Kampen obstruction conjecture. The van Kampen obstruction vanishes if and only if is approximable by embeddings.
- 0 votes0 replies0 views
Failure of derivative criteria for simplicial maps of connected graphs
Failure conjecture. The analogues of these criteria for are false.
- 0 votes0 replies0 views
McL conjecture on algebraic characterisation of planar Peano continua
Let be a compact, locally connected, metrizable space that is locally embeddable in . A simple set of circles in is a set of circles with the simplicity property u…
- 0 votes0 replies0 views
Derivative and van Kampen criterion for graph maps in the plane
Graph-map criterion conjecture. The map is approximable by embeddings if and only if
- 0 votes0 replies0 views
Disjoint-arc criterion for approximability by embeddings
Disjoint-arc criterion. The path is approximable by embeddings if and only if, for every pair of disjoint arcs , the restrictions…
- 0 votes0 replies0 views
Generalized theorem for simplicial maps between arbitrary graphs
Generalized graph-map conjecture. Theorem1.5 is true for .