A Polynomial Invariant Of Twisted Graph Diagrams

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower bound for the virtual crossing number of virtual graph diagrams.
22 pages

Keywords

Geometric Topology, Combinatorics, 57M25;05C10

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/132028

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0706.2854
 http://arxiv.org/abs/0706.2854

Collections

arXiv