1 citations · 1 across the 10 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
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,…
math.CO2024
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…
math.HO2024
Cycles in graphs and in hypergraphs: towards homology theory
A. Miroshnikov, O. Nikitenko, A. Skopenkov
In this expository paper we present some ideas of algebraic topology (more precisely, of homology theory) in a language accessible to non-specialists in the area. A -cycle in a…