pith. sign in

arxiv: 1210.1539 · v1 · pith:KBRCAUQ7new · submitted 2012-10-04 · 🧮 math.CO · math.GT

A generalization of Vassiliev's planarity criterion

classification 🧮 math.CO math.GT
keywords graphsgeneralizationgraphstructurevassilievvertexconditionsconjecture
0
0 comments X
read the original abstract

Motivated by his studies in knot theory V. Vassiliev introduced $X$-graphs as regular 4-valent graph with a structure of pairs of opposite edges at each vertex. He conjectured the conditions under which $X$-graph can be embedded into a plane respecting the the $X$-structure at every vertex. The conjecture was proved by V.Manturov. Here we generalize these results for graphs with vertices of valency 4 or 6, *-graphs. A problem of such generalization was posted by A.Skopenkov.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.