$K_{1,2,2,2}$ has no $n$-fold planar cover graph for $n<14$

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Annor, Dickson Y. B., Nikolayevsky, Yuri, Payne, Michael S.
Format: Preprint
Publié: 2023
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866913494788472832
author Annor, Dickson Y. B.
Nikolayevsky, Yuri
Payne, Michael S.
author_facet Annor, Dickson Y. B.
Nikolayevsky, Yuri
Payne, Michael S.
contents S. Negami conjectured in $1988$ that a connected graph has a finite planar cover if and only if it embeds in the projective plane. It follows from the works of D. Archdeacon, M. Fellows, P. Hliněný, and S. Negami that this conjecture is true if the graph $K_{1, 2, 2, 2}$ has no finite planar cover. We prove a number of structural results about putative finite planar covers of $K_{1,2,2,2}$ that may be of independent interest. We then apply these results to prove that $K_{1, 2, 2, 2}$ has no planar cover of fold number less than $14$.
format Preprint
id arxiv_https___arxiv_org_abs_2311_01672
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle $K_{1,2,2,2}$ has no $n$-fold planar cover graph for $n<14$
Annor, Dickson Y. B.
Nikolayevsky, Yuri
Payne, Michael S.
Combinatorics
05C10 (Primary), 57M15 (Secondary)
S. Negami conjectured in $1988$ that a connected graph has a finite planar cover if and only if it embeds in the projective plane. It follows from the works of D. Archdeacon, M. Fellows, P. Hliněný, and S. Negami that this conjecture is true if the graph $K_{1, 2, 2, 2}$ has no finite planar cover. We prove a number of structural results about putative finite planar covers of $K_{1,2,2,2}$ that may be of independent interest. We then apply these results to prove that $K_{1, 2, 2, 2}$ has no planar cover of fold number less than $14$.
title $K_{1,2,2,2}$ has no $n$-fold planar cover graph for $n<14$
topic Combinatorics
05C10 (Primary), 57M15 (Secondary)
url https://arxiv.org/abs/2311.01672