HLINĚNÝ, Petr. 20 years of Negami's planar cover conjecture. In 20th Workshop on topological graph theory in Yokohama. 2008.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name 20 years of Negami's planar cover conjecture
Name in Czech 20 let Negamiho hypotézy planárních pokrytí
Authors HLINĚNÝ, Petr.
Edition 20th Workshop on topological graph theory in Yokohama, 2008.
Other information
Original language English
Type of outcome Requested lectures
Field of Study 10101 Pure mathematics
Country of publisher Japan
Confidentiality degree is not subject to a state or trade secret
WWW conference
Organization unit Faculty of Informatics
Keywords in English planar covers; projective embedding
Tags planar covers, projective embedding
Tags International impact
Changed by Changed by: prof. RNDr. Petr Hliněný, Ph.D., učo 168881. Changed: 24/9/2013 09:57.
Abstract
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.
Abstract (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 projectName: Využití strukturálních a "šířkových" parametrů v kombinatorice a algoritmické složitosti
Investor: Czech Science Foundation, Utilization of Structural and Width Parametres in Combinatorics and Algorithmic Complexity
MSM0021622419, plan (intention)Name: Vysoce paralelní a distribuované výpočetní systémy
Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems
PrintDisplayed: 6/6/2024 10:46