INFINITE FAMILIES OF BIEMBEDDING NUMBERS

Let N(γ, γ′) denote the size of the smallest complete graph that cannot be edge‐partitioned into two parts embeddable in closed orientable sufaces of genera γ, γ′, respectively. Well‐known embedding theorems are used to obtain several infinite families of values of N(γ, γ′). Some related small values of N(γ, γ′) are also discussed. Copyright © 1979 Wiley Periodicals, Inc., A Wiley Company