J. Korean Math. Soc. 2004; 41(3): 407-421
Printed May 1, 2004
Copyright © The Korean Mathematical Society.
Paola Cristofori
Universita di Modena e Reggio Emilia
By using a recursive algorithm, we construct edge-coloured graphs representing products of spheres and consequently we give upper bounds for the regular genus of $\mathbb S^m \times \mathbb S^n$, for each $m,n>0$.
Keywords: regular genus, product of spheres
MSC numbers: 57M15, 57Q15, 05C10
© 2022. The Korean Mathematical Society. Powered by INFOrang Co., Ltd