Detailed Information on Publication Record
2008
20 years of Negami's planar cover conjecture
HLINĚNÝ, PetrBasic information
Original name
20 years of Negami's planar cover conjecture
Name in Czech
20 let Negamiho hypotézy planárních pokrytí
Authors
Edition
20th Workshop on topological graph theory in Yokohama, 2008
Other information
Language
English
Type of outcome
Vyžádané přednášky
Field of Study
10101 Pure mathematics
Country of publisher
Japan
Confidentiality degree
není předmětem státního či obchodního tajemství
References:
Organization unit
Faculty of Informatics
Keywords in English
planar covers; projective embedding
Tags
International impact
Změněno: 24/9/2013 09:57, prof. RNDr. Petr Hliněný, Ph.D.
V originále
In 1988, Seiya Negami published a conjecture stating that a graph $G$ has a finite planar cover (i.e.~a homomorphism from some planar graph onto $G$ which maps the vertex neighbourhoods bijectively) if and only if $G$ embeds in the projective plane. Though the "if" direction is easy, and some supporting weaker statements have been shown by him, the conjecture is still open, after more than 20 years of intensive investigation. We review the (quite significant) progress made so far in solving Negami's conjecture, and propose possible promising directions of future research.
In Czech
Ve článku shrnujeme všechny doposud dosažené výsledky při řešení hypotézy planárních pokrytí, kterou zformuloval Negami v roce 1988.
Links
| GA201/08/0308, research and development project |
| ||
| MSM0021622419, plan (intention) |
|