2000 character limit reached
On winding numbers of almost embeddings of in the plane
Published 26 Jan 2025 in math.GT, cs.CG, and math.CO | (2501.15642v2)
Abstract: 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 take the winding number of the -image of the cycle around . It is known that the sum of these four integers is odd. We construct examples showing that this is the only relation between these four numbers.
Paper Prompts
Sign up for free to create and run prompts on this paper.