A. Miroshnikov

collaborators

3 papers

math.GT2026

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.GT2025

On winding numbers of almost embeddings of $K_{4}$ in the plane

Emil Alkin, Alexander Miroshnikov

Let $K_{4}$ be the complete graph on four vertices. Let $f$ be a continuous map of $K_{4}$ to the plane such that $f$ -images of non-adjacent edges are disjoint. For any vertex $v \in K…

math.HO2025

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 $1$ -cycle in a…

Invariants of almost embeddings of graphs in the plane

On winding numbers of almost embeddings of K4​ in the plane

Cycles in graphs and in hypergraphs: towards homology theory

On winding numbers of almost embeddings of $K_{4}$ in the plane