Showing math.GTShow all
2 papers · 1 filter
math.GT2025
On winding numbers of almost embeddings of in the plane
Emil Alkin, Alexander Miroshnikov
Let be the complete graph on four vertices. Let be a continuous map of to the plane such that -images of non-adjacent edges are disjoint. For any vertex $v \in K…
math.GT2024
Invariants of almost embeddings of graphs in the plane
E. Alkin, A. Miroshnikov, A. Skopenkov
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely,…