Cantankerous maps and rotary embeddings of Kn

Research output: Contribution to journalArticle

33 Citations (Scopus)

Abstract

In this paper we will define a class of locally non-orientable regular maps called "cantankerous." We will show that cantankerous maps are self-Petrie, we will prove a lower bound on the number of vertices such a map may have, and we will give some data which suggest that the cantankerous maps are a fairly restricted class of regular maps. Our main result here is that any vertex-improper map must either be one of these cantankerous maps or be constructed from a smaller vertex-proper map by the Riemann-surface algorithm. We then apply these results to graph theory. Biggs has shown that if M is an orientable rotary map whose underlying graph is Kn, then n must be a power of a prime. We will show that, if n > 6, Kn has no regular embedding; this shows that the only exception to Biggs' theorem in the non-orientable case is n = 6, and that the rotary embeddings of Kn given by Heffter's construction are chiral.

Original languageEnglish (US)
Pages (from-to)262-273
Number of pages12
JournalJournal of Combinatorial Theory. Series B
Volume47
Issue number3
DOIs
StatePublished - 1989

Fingerprint

Regular Map
Regular Embedding
Proper Map
Vertex of a graph
Riemann Surface
Graph theory
Exception
Lower bound
Graph in graph theory
Theorem
Class

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Cantankerous maps and rotary embeddings of Kn. / Wilson, Stephen E.

In: Journal of Combinatorial Theory. Series B, Vol. 47, No. 3, 1989, p. 262-273.

Research output: Contribution to journalArticle

@article{5b4c3a08901a4d64bea3327066467fb3,
title = "Cantankerous maps and rotary embeddings of Kn",
abstract = "In this paper we will define a class of locally non-orientable regular maps called {"}cantankerous.{"} We will show that cantankerous maps are self-Petrie, we will prove a lower bound on the number of vertices such a map may have, and we will give some data which suggest that the cantankerous maps are a fairly restricted class of regular maps. Our main result here is that any vertex-improper map must either be one of these cantankerous maps or be constructed from a smaller vertex-proper map by the Riemann-surface algorithm. We then apply these results to graph theory. Biggs has shown that if M is an orientable rotary map whose underlying graph is Kn, then n must be a power of a prime. We will show that, if n > 6, Kn has no regular embedding; this shows that the only exception to Biggs' theorem in the non-orientable case is n = 6, and that the rotary embeddings of Kn given by Heffter's construction are chiral.",
author = "Wilson, {Stephen E}",
year = "1989",
doi = "10.1016/0095-8956(89)90028-2",
language = "English (US)",
volume = "47",
pages = "262--273",
journal = "Journal of Combinatorial Theory. Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",
number = "3",

}

TY - JOUR

T1 - Cantankerous maps and rotary embeddings of Kn

AU - Wilson, Stephen E

PY - 1989

Y1 - 1989

N2 - In this paper we will define a class of locally non-orientable regular maps called "cantankerous." We will show that cantankerous maps are self-Petrie, we will prove a lower bound on the number of vertices such a map may have, and we will give some data which suggest that the cantankerous maps are a fairly restricted class of regular maps. Our main result here is that any vertex-improper map must either be one of these cantankerous maps or be constructed from a smaller vertex-proper map by the Riemann-surface algorithm. We then apply these results to graph theory. Biggs has shown that if M is an orientable rotary map whose underlying graph is Kn, then n must be a power of a prime. We will show that, if n > 6, Kn has no regular embedding; this shows that the only exception to Biggs' theorem in the non-orientable case is n = 6, and that the rotary embeddings of Kn given by Heffter's construction are chiral.

AB - In this paper we will define a class of locally non-orientable regular maps called "cantankerous." We will show that cantankerous maps are self-Petrie, we will prove a lower bound on the number of vertices such a map may have, and we will give some data which suggest that the cantankerous maps are a fairly restricted class of regular maps. Our main result here is that any vertex-improper map must either be one of these cantankerous maps or be constructed from a smaller vertex-proper map by the Riemann-surface algorithm. We then apply these results to graph theory. Biggs has shown that if M is an orientable rotary map whose underlying graph is Kn, then n must be a power of a prime. We will show that, if n > 6, Kn has no regular embedding; this shows that the only exception to Biggs' theorem in the non-orientable case is n = 6, and that the rotary embeddings of Kn given by Heffter's construction are chiral.

UR - http://www.scopus.com/inward/record.url?scp=38249026446&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38249026446&partnerID=8YFLogxK

U2 - 10.1016/0095-8956(89)90028-2

DO - 10.1016/0095-8956(89)90028-2

M3 - Article

AN - SCOPUS:38249026446

VL - 47

SP - 262

EP - 273

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

SN - 0095-8956

IS - 3

ER -