Invariants of Graph Drawings in the Plane

@article{Skopenkov2018InvariantsOG,
  title={Invariants of Graph Drawings in the Plane},
  author={Arkadiy Skopenkov},
  journal={Arnold Mathematical Journal},
  year={2018},
  volume={6},
  pages={21-55}
}
  • A. Skopenkov
  • Published 25 May 2018
  • Mathematics
  • Arnold Mathematical Journal
We present a simplified exposition of some classical and modern results on graph drawings in the plane. These results are chosen so that they illustrate some spectacular recent higher-dimensional results on the border of geometry, combinatorics and topology. We define a $${\mathbb {Z}}_2$$ Z 2 valued self-intersection invariant (i.e. the van Kampen number) and its generalizations. We present elementary formulations and arguments accessible to mathematicians not specialized in any of the areas… 
Geometric Embeddability of Complexes is $\exists \mathbb R$-complete
We show that the decision problem of determining whether a given (abstract simplicial) k-complex has a geometric embedding in R is complete for the Existential Theory of the Reals for all d ≥ 3 and k
Geometric Embeddability of Complexes is ∃R-complete
We show that the decision problem of determining whether a given (abstract simplicial) k-complex has a geometric embedding in R is complete for the Existential Theory of the Reals for all d ≥ 3 and k
Adjacency Graphs of Polyhedral Surfaces
TLDR
It is shown that every graph is realizable as a polyhedral surface with arbitrary polygonal cells, and that this is not true if the authors require the cells to be convex.
Extendability of simplicial maps is undecidable
TLDR
A gap is exhibited in the Filakovský-Wagner-Zhechev proof that embeddability of complexes is undecidable in codimension $>1$ and there is no algorithm recognizing the extendability of the identity map of S^l\vee S* to a PL map.
A user's guide to basic knot and link theory
We define simple invariants of knots or links (linking number, Arf-Casson invariants and Alexander-Conway polynomials) motivated by interesting results whose statements are accessible to a
Crossing numbers and rotation numbers of cycles in a plane immersed graph
. For any generic immersion of a Petersen graph into a plane, the number of crossing points between two edges of distance one is odd. The sum of the crossing numbers of all 5-cycles is odd. The sum
Towards a short proof of the Fulek-Kynčl criterion for modulo 2 embeddability of graphs to surfaces
TLDR
A general position PL map g : K → M (a.k.a. a graph drawing on M) is called a Z2(almost) embedding if |gσ ∩ gτ | is even for any pair σ, τ of non-adjacent edges so that the graph K to Sg is homeomorphic to the sphere with g handles and a hole.
Embeddings of k-complexes in 2k-manifolds and minimum rank of partial symmetric matrices
TLDR
This work proves that for k ≥ 3 odd K embeds into M if and only if there are a skew-symmetric n × n-matrix A with Z-entries whose rank over Q does not exceed rkHk(M ;Z), and a collection of orientations on k-faces of K such that for any nonadjacent k- faces σ, τ the element Aσ,τ equals to the algebraic intersection of fσ and fτ.
Hardness of almost embedding simplicial complexes in $$\mathbb {R}^d$$Rd
TLDR
The new part of the argument is a stronger ‘almost embeddings’ version of the generalized van Kampen–Flores theorem, based on the technique from the Matoušek–Tancer–Wagner paper and on singular versions of the higher-dimensional Borromean rings lemma.
On different reliability standards in current mathematical research
. In this note I describe reliability standards for writing and reviewing mathematical papers; these standards are (in my opinion) vital for the progress of mathematics. I give examples of applying
...
...

References

SHOWING 1-10 OF 115 REFERENCES
G T ] 2 5 M ay 2 01 8 Invariants of graph drawings in the plane
We present a simplified exposition of some classical and modern results on graph drawings in the plane. These results are chosen so that they illustrate some spectacular recent higher-dimensional
Surveys in Contemporary Mathematics: Embedding and knotting of manifolds in Euclidean spaces
A clear understanding of topology of higher-dimensional objects is important in many branches of both pure and applied mathematics. In this survey we attempt to present some results of
Singularities, Expanders and Topology of Maps. Part 2: from Combinatorics to Topology Via Algebraic Isoperimetry
We find lower bounds on the topology of the fibers $${F^{-1}(y)\subset X}$$ of continuous maps F : X → Y in terms of combinatorial invariants of certain polyhedra and/or of the cohomology algebras
Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry
A number of important results in combinatorics, discrete geometry, and theoretical computer science have been proved using algebraic topology. While the results are quite famous, their proofs are not
Embedding products of graphs into Euclidean spaces
For any collection of graphs we find the minimal dimension d such that the product of these graphs is embeddable into the d-dimensional Euclidean space. In particular, we prove that the n-th powers
On the Kuratowski graph planarity criterion
TLDR
This paper presents the Makarychev proof (with further simplifications by Prasolov, Telishev, Zaslavski and the author) which is possibly the simplest proof of the Kuratowski graph planarity criterion.
3N Colored Points in a Plane
More than 50 years ago, the Cambridge undergraduate Bryan Birch showed that “3N points in a plane” can be split into N triples that span triangles with a non-empty intersection. He also conjectured a
Some short proofs of the nonrealizability of hypergraphs
This note is expository and is accessible to students who know basic geometry of three-dimensional space and who are ready to learn its straightforward generalizations to four-dimensional space. We
The van Kampen obstruction and its relatives
AbstractWe review a cochain-free treatment of the classical van Kampen obstruction ϑ to embeddability of an n-polyhedron in ℝ2n and consider several analogs and generalizations of ϑ, including an
Van Kampen’s embedding Obstruction is incomplete for $2$-Complexes in $\rz^{4}$
In 1933, anticipating formal cohomology theory, van Kampen [5] gave a slightly rough description of an obstruction o(K) ∈ H Z/2(K , Z) which vanishes if and only if an n-dimensional simplicial
...
...