| 关于L.Lovász定理的简证 |
| |
| 作者姓名： | 黄思明 田铁虹 |
| |
| 作者单位： | Institute of Systems Science,Academia Sinica,Huazhong University of Science and Technology |
| |
| 摘 要： | In 1983 J. A. Bondy mentioned a result of L.Lovsz. He said that it seems"magic". Now we give a simple proof of this result by using the basic probability theory only, and we may see why this result holds clearly. Let G be a graph with a specified vertex r.A path P=v_1v_2…v_k is rooted at r if v_1=r.For 1≤j≤k, the number of edges of G which are incident with v_j but with no v_i, i
|
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《数学研究及应用》浏览原始摘要信息 |
|
点击此处可从《数学研究及应用》下载全文 |
|
