Copy the page URI to the clipboard
Grannell, Mike and Knor, Martin
(2012).
URL: http://www.combinatorics.org/ojs/index.php/eljc/ar...
Abstract
For each integer ,
, for each odd integer
, and for any
of (multiplicative) order
where
, we construct a biembedding of Latin squares in which one of the squares is the Cayley table of the metacyclic group
. This extends the spectrum of Latin squares known to be biembeddable.
The best existing lower bounds for the number of triangular embeddings of a complete graph in an orientable surface are of the form
for suitable positive constants
and for restricted infinite classes of
. Using embeddings of
, we extend this lower bound to a substantially larger class of values of
.
Viewing alternatives
Item Actions
Export
About
- Item ORO ID
- 34309
- Item Type
- Journal Item
- ISSN
- 1077-8926
- Extra Information
- 17 pp.
- Keywords
- triangular embedding; Latin square; complete graph; complete tripartite graph; metacyclic group
- Academic Unit or School
-
Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM) - Copyright Holders
- © 2012 The Authors
- Related URLs
- Depositing User
- Mike Grannell