Grannell, Mike and Knor, Martin
|Google Scholar:||Look up in Google Scholar|
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 .
|Item Type:||Journal Article|
|Copyright Holders:||2012 The Authors|
|Extra Information:||17 pp.|
|Keywords:||triangular embedding; Latin square; complete graph; complete tripartite graph; metacyclic group|
|Academic Unit/Department:||Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM)
|Depositing User:||Mike Grannell|
|Date Deposited:||10 Sep 2012 09:25|
|Last Modified:||04 Oct 2016 11:19|
|Share this page:|