國立政治大學應用數學系離散與代數學術演講
時 間：96年12月05日(星期三) 15:10 – 17:00
演講人：魏子謙博士 (國立中央研究院數學研究所)
題 目：Introduction to Edge Colouring(二)
綱 要：In this series of lectures, I plan to give an introduction to the theory of edge colouring of graphs and multigraphs. This field started at the end of the nineteenth century with the work of Tait and Petersen, and continued in the twentieth century with many contributors, the principal ones being probably König, Shannon and Vizing. It is widely recognized as an important field of research in discrete mathematics, with many applications and interesting theoretical challenges, most of which are still open today. In the first lecture, we shall give the essential definitions, and completely classify from the edge-colouring point of view complete graphs, paths, cycles, as well as bipartite graphs. A proof of the most important theorem of edge-colouring (Vizing’s Theorem), which states that every simple graph G has an edge colouring which uses at most Δ + 1 colours, where is the maximum degree of G, will be given. In the subsequent lecture(s) we shall treat more advanced topics, including a discussion of the main longstanding conjectures in the field, namely Vizing’s Conjecture, the Overfull Conjecture, the 1-Factorization Conjecture, the Goldberg-Seymour Conjecture, and an analysis of the tools that were used so far to attack these conjectures.
地 點：果夫一樓研討室二 080120
備 註：茶會時間為14:30 ~ 15:00於教授休息室。
國立政治大學應用數學系 敬邀!