摘要
It is known (for example, see [4]) that the maximum genus of a graph is mainly determined by the Betti deficiency of the graph. In this paper, we establish a best upper bound on the Betti deficiency of a graph bounded by its independence number and girth, and immediately obtain a new result on the maximum genus.
图的最大亏损主要由其参数Ｂｅｔｔｉ亏数确定（例如，见［３］）．本文给出了由图的独立数及围长所确定的Ｂｅｔｔｉ亏数的一个最好上界 ，从而即可得到关于图的最大亏格的一个新结果．
基金
Supported by the National Natural Scicnce Foundation of China !(19801013)
