Table of Contents
Fetching ...

Bounds on the genus for 2-cell embeddings of prefix-reversal graphs

Saúl A. Blanco, Charles Buehrle

TL;DR

The upper bound for $\mathbb{P}_n$ is sharper than the previously-known bound, and the other bounds presented are the first of their kind.

Abstract

In this paper, we provide bounds for the genus of the pancake graph $\mathbb{P}_n$, burnt pancake graph $\mathbb{BP}_n$, and undirected generalized pancake graph $\mathbb{P}_m(n)$. Our upper bound for $\mathbb{P}_n$ is sharper than the previously-known bound, and the other bounds presented are the first of their kind. Our proofs are constructive and rely on finding an appropriate rotation system (also referred to in the literature as Edmonds' permutation technique) where certain cycles in the graphs we consider become boundaries of regions of a 2-cell embedding. A key ingredient in the proof of our bounds for the genus $\mathbb{P}_n$ and $\mathbb{BP}_n$ is a labeling algorithm of their vertices that allows us to implement rotation systems to bound the number of regions of a 2-cell embedding of said graphs. All of our bounds are asymptotically tight; in particular, the genus of $\mathbb{P}_m(n)$ is $Θ(m^nnn!)$ for all $m\geq1$ and $n\geq2$.

Bounds on the genus for 2-cell embeddings of prefix-reversal graphs

TL;DR

The upper bound for is sharper than the previously-known bound, and the other bounds presented are the first of their kind.

Abstract

In this paper, we provide bounds for the genus of the pancake graph , burnt pancake graph , and undirected generalized pancake graph . Our upper bound for is sharper than the previously-known bound, and the other bounds presented are the first of their kind. Our proofs are constructive and rely on finding an appropriate rotation system (also referred to in the literature as Edmonds' permutation technique) where certain cycles in the graphs we consider become boundaries of regions of a 2-cell embedding. A key ingredient in the proof of our bounds for the genus and is a labeling algorithm of their vertices that allows us to implement rotation systems to bound the number of regions of a 2-cell embedding of said graphs. All of our bounds are asymptotically tight; in particular, the genus of is for all and .
Paper Structure (21 sections, 11 theorems, 32 equations, 3 figures, 4 tables, 2 algorithms)

This paper contains 21 sections, 11 theorems, 32 equations, 3 figures, 4 tables, 2 algorithms.

Key Result

Proposition 2.2

(W22) Given a simple, undirected graph $G$, there exists a bijection between the rotation systems and the orientable 2-cell embeddings of $G$.

Figures (3)

  • Figure 1: Labeling of $V(\mathbb{P}_4)$ after running $\textsc{AlGra}(\mathbb{P}_4,1234, 4)$. The vertices in $V_1$ are indicated with a rectangle and the vertices in $V_2$ are indicated with a rounded rectangle. The base cycle $(r_3r_4)^4$ starting at $1234$ is indicated with dashed edges.
  • Figure 2: Labeling of $V(\mathbb{BP}_4)$ after running $\textsc{AlGra}(\mathbb{BP}_3,123,3)$. The vertices in $V_1$ are indicated with a rectangle and the vertices in $V_2$ are indicated with a rounded rectangle. The base cycle $(r_2r_3)^6$ starting at $123$ is indicated with dashed edges.
  • Figure 3: The graph $\mathbb{P}_3(2)$ contains $K_{3,3}$ as a minor where the vertices forming the two independent sets are inside a rectangle or a circled rectangle, respectively. Therefore $\mathbb{P}_3(2)$ is not planar.

Theorems & Definitions (30)

  • Remark 1.1
  • Remark 2.1
  • Proposition 2.2
  • Remark 3.1
  • Proposition 3.2
  • Definition 3.1
  • Example 3.2
  • Example 3.3
  • Proposition 3.3
  • proof
  • ...and 20 more