Johannes Carmesin

University of Birmingham


Embedding simply connected 2-complexes in 3-space


Combinatorics Seminar


5th February 2019, 11:00 am – 12:00 pm
Howard House, 4th Floor Seminar Room


A classical theorem of Kuratowski characterises graphs
embeddable in the plane by two obstructions. More precisely, a graph
is planar if and only if it does not contain the complete graph K_5 or
the complete bipartite graph K_{3,3} as a minor.

Can you characterise embeddability of 2-dimensional simplicial
complexes in 3-space in a way analogous to Kuratowski’s
characterisation of graph planarity?






Comments are closed.
css.php