摘要
本文研究了Lovsz一个定理的证明后,对其证明和定理本身进行了两大探索,一是指出并找到了更一般、更简单的函数替代证明过程中的繁琐函数而得到定理,二是将定理中的最大度替换成最小度研究其结论是否成立,并进行了证明.
In this paper, after studying the proof of a theorem of Lova? sz, two explorations were carried out in the proof and theorem itself. One is to point out and find more general and more uncomplicated functions instead of the complicated ones in the process of proving the theorem. The second is to replace the maximum degree of the theorem to the minimum degree, and to study and prove whether the conclusion is established.
出处
《阴山学刊(自然科学版)》
2017年第2期5-6,共2页
Yinshan Academic Journal(Natural Science Edition)
关键词
图论
连通图
划分
完全子图
Graph theory
Connected graph
Division
Complete subgraph