Invariants of almost embeddings of graphs in the plane: results and problems

E. Alkin, E. Bordacheva, A. Miroshnikov +2

A graph drawing in the plane is called an almost embedding if images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. We introduce integer invariants of alm…