Invariants of almost embeddings of graphs in the plane: results and problems
<|reference_start|>Invariants of almost embeddings of graphs in the plane: results and problems: 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 almost embeddings: winding number, cyclic and triodic Wu numbers. We construct almost embeddings realizing some values of these invariants. We prove some relations between the invariants. We study values realizable as invariants of some almost embedding, but not of any embedding.   This paper is expository and is accessible to mathematicians not specialized in the area (and to students). However elementary, this paper is motivated by frontline of research.<|reference_end|>
@article{alkin2024invariants,
    title={Invariants of almost embeddings of graphs in the plane: results and
  problems},
    author={E. Alkin, E. Bordacheva, A. Miroshnikov, O. Nikitenko, A. Skopenkov},
    journal={arXiv preprint arXiv:2408.06392},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.06392},
    primaryClass={math.CO cs.CG math.HO}
}