Zum Endlichkeitsproblem der Minimalbasen für beliebige Flächen (Q1057874): Difference between revisions

In the present paper let \({\mathfrak F}\) be an orientable or non-orientable surface and let \(\Gamma\) be the set of all finite undirected simple graphs which are not embeddable into \({\mathfrak F}\). If \(>_ 4\) is the partial ordering on \(\Gamma\) having been introduced in a paper of the authors and \textit{H. Schumacher} [Abh. Math. Sem. Univ. Hamb. 51, 232-243 (1981; Zbl 0462.05031)], and if \(M(\Gamma,>_ 4)\) is the set of all \(>_ 4\)-minimal graphs of \(\Gamma\), so it is proved that the minimal basis \(M(\Gamma,>_ 4)\) is finite for every surface \({\mathfrak F}\), surely provided that all graphs of \(M(\Gamma,>_ 4)\) contain normal subgraphs being embeddable in \({\mathfrak F}\). In this case a graph G is normally embeddable in \({\mathfrak F}\) if, and only if, G is embeddable in \({\mathfrak F}\) and if all faces of G in \({\mathfrak F}\) are bordered by exactly one circuit of G for every embedding of G in \({\mathfrak F}\). By estimating skillfully it can be shown that the minimal basis \(M(\Gamma,>_ 4)\) contains at most a finite number of graphs. At last the results are used in order to prove that the minimal basis \(M(proj.plane,>_ 4)\) is finite. Referring to the well-known fact that all graphs of this minimal basis - except three of them - contain a subdivision of the \(K_{3,3}\) being normally embeddable in the projective plane the proof of the finiteness of \(M(proj.plane,>_ 4)\) is a simple consequence of the above mentioned theorem.