Stability of intersections of graphs in the plane and the van Kampen obstruction

DOI10.1016/J.TOPOL.2018.02.029zbMath1422.57068arXiv1609.03727OpenAlexW2520046653WikidataQ130153863 ScholiaQ130153863MaRDI QIDQ1744614

Arkadij B. Skopenkov

Publication date: 23 April 2018

Published in: Topology and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.03727

zbMATH Keywords

van Kampen obstructionHanani-Tutte theoremdeleted productapproximability by embeddingscluster planaritygraphs drawingweak simplicity

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Embedding (54C25) Research exposition (monographs, survey articles) pertaining to manifolds and cell complexes (57-02) Research exposition (monographs, survey articles) pertaining to general topology (54-02) Approximations in PL-topology (57Q55)

Related Items (3)

On approximability by embeddings of cycles in the plane. ⋮ Hanani-Tutte for approximating maps of graphs ⋮ Invariants of graph drawings in the plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hardness of embedding simplicial complexes in \(\mathbb R^d\)
• Obstructions to approximating maps of \(n\)-manifolds into \(\mathbb{R}^{2n}\) by embeddings
• Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
• Clustered planarity testing revisited
• On embedding a cycle in a plane graph
• Embedding \(T^ n\)-like continua in Euclidean space
• Moving compacta in \(\mathbb{R}{}^ m\) apart
• A deleted product criterion for approximability of maps by embeddings
• On approximability by embeddings of cycles in the plane.
• Van Kampen's embedding obstruction is incomplete for 2-complexes in \(\mathbb{R}^ 4\)
• Eliminating higher-multiplicity intersections. III. Codimension 2
• Algorithmic solvability of the lifting-extension problem
• Bounded Embeddings of Graphs in the Plane
• Hanani–Tutte, Monotone Drawings, and Level-Planarity
• Towards the Hanani-Tutte Theorem for Clustered Graphs
• Recognizing weakly simple polygons
• Towards an implementation of the 3D visibility skeleton
• On isotopic and discrete realizations of maps of an $ n$-dimensional sphere in Euclidean space
• On the dimension of the product of two compacta and the dimension of their intersection in general position in Euclidean space
• Hanani-Tutte for approximating maps of graphs
• Embedding Graphs into Embedded Graphs
• Detecting Weakly Simple Polygons
• Realization of mappings

This page was built for publication: Stability of intersections of graphs in the plane and the van Kampen obstruction