Using paralled mathematic induction method ， it proved that maximum plane graph with any degree which is contructed by way of " adding point within plane " or " adding point at the edge " is 4 - colorable 运用“并行(或平行)数学归纳法”证明了由“面内加点”或“边上加点”方法所构造的任意阶极大平面图是可四着色的。
2.
Markov ' s inequality and four kinds of lovasz local lemma , and give different applications in hypergraphs with these probabilistic methods , we find different conditions for a hypergraph to be 2 - colorable with some kinds of thinkings ) sz局部引理的内容，给出了这几种概率方法在超图上的应用，用几种思路找到了超图存在2 -可染色的不同条件，其中着重对一般形式的lov (
3.
In chapter 2 , a relationship between three types of oriented triple systems mts , dts , hts is discussed , i . e . , if the block incidence graph of an mts ( v , a ) is 3 edge - colorable , then we can get three disjoint dts ( v , ) s and four disjoint hts ( v , ) s 第二章讨论三类有向三元系mts ， dts ， hts之间的一种关联关系：如果一个mts ( v ， )的区组关联图是3 -边可染色的，则可得到三个不相交的dts ( v ， )及四个不相交的hts ( v ， ) ，且对应区组的基础集均一致。
