See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/242503674

Graphs, Groups and Surfaces

Article · January 1984

CITATIONS READS

305 2,320

1 author:

Arthur T. White
Western Michigan University
86 PUBLICATIONS 1,933 CITATIONS

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Taking a Look at the Book: These Are a Rew of My Favorite Proofs View project

All content following this page was uploaded by Arthur T. White on 09 December 2014.

The user has requested enhancement of the downloaded file.

GRAPHS OF GROUPS ON SURFACES
INTERACTIONS AND MODELS

Arthur T. WHITE

Western Michigan University

Kalamazoo, Michigan 49008
U.S.A.

&29
2001
ELSEVIER
Amsterdam - London - New York - Oxford - Paris - Shannon - Tokyo
 Contents

Chapter 1. HISTORICAL SETTING 1

Chapter 2. A BRIEF INTRODUCTION TO GRAPH THEORY 5

2-1. Definition of a Graph 5
2-2. Variations of Graphs 6
2-3. Additional Definitions 6
2-4. Operations on Graphs 9
2-5. Problems 11

Chapter 3. THE AUTOMORPHISM GROUP OF A GRAPH 13

3-1. Definitions 13
3-2. Operations on Permutations Groups 14
3-3. Computing Automorphism Groups of Graphs 15
3-4. Graphs with a Given Automorphism Group 17
3-5. Problems 17

Chapter 4. THE CAYLEY COLOR GRAPH OF A GROUP

PRESENTATION 19
4-1. Definitions 19
4-2. Automorphisms 22
4-3. Properties 24
4-4. Products 26
4-5. Cayley Graphs 29
4-6. Problems 30

Chapter 5. AN INTRODUCTION TO SURFACE TOPOLOGY 33

5-1. Definitions 33
5-2. Surfaces and Other 2-manifolds 35
5-3. The Characteristic of a Surface 36
x CONTENTS

5-4. Three Applications 40

5-5. Pseudosurfaces 46
5-6. Problems 46

Chapter 6. IMBEDDING PROBLEMS IN GRAPH THEORY 49

6-1. Answers to Some Imbedding Questions 49
6-2. Definition of "Imbedding" 52
6-3. The Genus of a Graph 52
6-4. The Maximum Genus of a Graph 55
6-5. Genus Formulae for Graphs 58
6-6. Rotation Schemes 62
6-7. Imbedding Graphs on Pseudosurfaces 64
6-8. Other Topological Parameters for Graphs 66
6-9. Applications 69
6-10. Problems 70

Chapter 7. THE GENUS OF A GROUP 73

7-1. Imbeddings of Cayley Color graphs 73
7-2. Genus Formulae for Groups 77
7-3. Related Results 84
7-4. The Characteristic of a Group 86
7-5. Problems 87

Chapter 8. MAP-COLORING PROBLEMS 89

8-1. Definitions and the Six-Color Theorem 90
8-2. The Five-Color Theorem 90
8-3. The Four-Color Theorem 91
8-4. Other Map-Coloring Problems:
The Heawood Map-Coloring Theorem 92
8-5. A Related Problem 96
8-6. A Four-Color Theorem for the Torus 98
8-7. A Nine-Color Theorem for the Torus and Klein Bottle 101
8-8. fc-degenerate Graphs 101
8-9. Coloring Graphs on Pseudosurfaces 103
8-10. The Cochromatic Number of Surfaces 105
 CONTENTS xi

8-11. Problems 105

Chapter 9. QUOTIENT GRAPHS AND QUOTIENT

MANIFOLDS: CURRENT GRAPHS AND THE
COMPLETE GRAPH THEOREM 107
9-1. The Genus of Kn 107
9-2. The Theory of Current Graphs as Applied to Kn 109
9-3. A Hint of Things to Come 114
9-4. Problems 116

Chapter 10. VOLTAGE GRAPHS 119

10-1. Covering Spaces 119
10-2. Voltage Graphs 121
10-3. Examples 128
10-4. The Heawood Map-coloring Theorem (again) 134
10-5. Strong Tensor Products 135
10-6. Covering Graphs and Graphical Products 136
10-7. Problems 139

Chapter 11. NONORIENTABLE GRAPH IMBEDDINGS 143

11-1. General Theory 143
11-2. Nonorientable Covering Spaces 145
11-3. Nonorientable Voltage Graph Imbeddings 146
11-4. Examples 147
11-5. The Heawood Map-coloring Theorem,
Nonorientable Version 151
11-6. Other Results 152
11-7. Problems 154

Chapter 12. BLOCK DESIGNS 157

12-1. Balanced Incomplete Block Designs 157
12-2. BIBDs and Graph Imbeddings 158
12-3. Examples 160
12-4. Strongly Regular Graphs 161
12-5. Partially Balanced Incomplete Block Designs 162
12-6. PBIBDs and Graph Imbeddings 164
xii CONTENTS

12-7. Examples 165

12-8. Doubling a PBIBD 168
12-9. Problems 169

Chapter 13. HYPERGRAPH IMBEDDINGS 173

13-1. Hypergraphs 173
13-2. Associated Bipartite Graphs 175
13-3. Imbedding Theory for Hypergraphs 175
13-4. The Genus of a Hypergraph 178
13-5. The Heawood Map-Coloring Theorem, for Hypergraphs 179
13-6. The Genus of a Block Design 180
13-7. An Example 181
13-8. Nonorientable Analogs 183
13-9. Problems 183

Chapter 14. FINITE FIELDS ON SURFACES 185

14-1. Graphs Modelling Finite Rings 185
14-2. Basic Theorems About Finite Fields 187
14-3. The genus of ¥p 189
14-4. The Genus of F p , 191
14-5. Further Results 194
14-6. Problems 196

Chapter 15. FINITE GEOMETRIES ON SURFACES 199

15-1. Axiom Systems for Geometries 199
15-2. n-Point Geometry 200
15-3. The Geometries of Fano, Pappus, and Desargues 201
15-4. Block Designs as Models for Geometries 205
15-5. Surface Models for Geometries 206
15-6. Fano, Pappus, and Desargues Revisited 207
15-7. 3-Configurations 209
15-8. Finite Projective Planes 215
15-9. Finite Affine Planes 223
15-10. Ten Models for AG(2,3) 228
15-11. Completing the Euclidean Plane 231
 CONTENTS xiii

15-12. Problems 232

Chapter 16. MAP AUTOMORPHISM GROUPS 235

16-1. Map Automorphisms 235
16-2. Symmetrical Maps 240
16-3. Cayley Maps 243
16-4. Complete Maps 247
16-5. Other Symmetrical Maps 249
16-6. Self-Complementary Graphs 250
16-7. Self-dual Maps 251
16-8. Paley Maps 255
16-9. Problems 264

Chapter 17. ENUMERATING GRAPH IMBEDDINGS 267

17-1. Counting Labelled Orientable 2-Cell Imbeddings 267
17-2. Counting Unlabelled Orientable 2-Cell Imbeddings 274
17-3. The Average Number of Symmetries 276
17-4. Problems 278

Chapter 18. RANDOM TOPOLOGICAL GRAPH THEORY 281

18-1. Model I 282
18-2. Model II 285
18-3. Model III 287
18-4. Model IV 288
18-5. Model V 289
18-6. Model VI: Random Cayley Maps 290
18-7. Problems 293

Chapter 19. CHANGE RINGING 295

19-1. The Setting .. 295
19-2. A Mathematical Model 299
19-3. Minimus 301
19-4. Doubles 305
19-5. Minor 311
19-6. Triples and Fabian Stedman 312
 xiv CONTENTS

19-7. Extents on n Bells 315

19-8. Summary 319
19-9. , Problems 320

REFERENCES 323

BIBLIOGRAPHY 351

INDEX OF SYMBOLS 353

INDEX OF DEFINITIONS 357

View publication