Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs

摘要

It is shown that there are constants M and c such that for ngreater than or equal toM the number of nonisomorphic nonorientable genus embeddings of the complete graph K-n is at least c2(n/6). (C) 2004 Elsevier Inc. All rights reserved.