Invariants of graph drawings in the plane

05/25/2018
by   A. Skopenkov, et al.
0

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 topology and combinatorics. We define a mod2-valued self-intersection invariant (i.e. the van Kampen number) and its generalizations. We present elementary formulations and arguments, so we do not require any knowledge of algebraic topology. This survey is accessible to mathematicians not specialized in any of the areas discussed. It may serve as an introduction into algebraic topology motivated by algorithmic, combinatorial and geometric problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/04/2019

Maximum Matchings in Geometric Intersection Graphs

Let G be an intersection graph of n geometric objects in the plane. We s...
research
09/21/2018

A numerical approach for the filtered generalized Cech complex

In this paper, we present an algorithm to compute the filtered generaliz...
research
02/09/2018

Minimum weight codewords in dual Algebraic-Geometric codes from the Giulietti-Korchmáros curve

In this paper we investigate the number of minimum weight codewords of s...
research
02/15/2021

Polynomial time algorithms in invariant theory for torus actions

An action of a group on a vector space partitions the latter into a set ...
research
09/13/2022

What is a combinatorial interpretation?

In this survey we discuss the notion of combinatorial interpretation in ...
research
04/27/2010

Integrating multiple sources to answer questions in Algebraic Topology

We present in this paper an evolution of a tool from a user interface fo...
research
05/13/2019

Stationary points at infinity for analytic combinatorics

On complex algebraic varieties, height functions arising in combinatoria...

Please sign up or login with your details

Forgot password? Click here to reset