离散数学-图论-Chapter02精要.ppt

* * * * * * 【例12.10】证明：世界上任何6个人中，一定有3个人或者互相认识或者互相都不认识。 【证】首先，给K6及其边着色赋予语义解释：6个顶点表示任意的6个人，如果两个人互相认识，就将对应的边着红色，否则着蓝色。其次，证明：用红篮两种颜色对完全图K6的边进行着色后，一定有红色的K3或者蓝色的K3 在K6中，顶点u关联5条边，根据鸽笼原理，至少有3条边着同一色。不失一般性，假设边（u，v1），（u，v2）和（u，v5）着红色，用虚线表示，见下图(a)。现在考虑边（v1，v2），（v1，v5）和（v2，v5）的着色情况，如果它们均着蓝色（用实线表示），则已经构成一个蓝色的K3，见下图(b)命题成立；如果它们中任何一条（不失一般性，假设为边（v1，v2））着红色（即虚线），则也必然出现由顶点v1、v2和u构成的K3，其每条边均着红色，命题亦成立。 作业二 P35 8 曹：P282 4，7 * * * * * * * * * * * * * * * * * * * * * * * * * * * * 判断哈密尔顿图 (相关的300多定理) 如果一个图不满足充分条件，但是又满足必要条件，如何判定其是否是哈密尔顿图？ 对于一个点，若有两条连接线都在H-图中，则其它的边不在H-图中 ? ? ? ? ? Three kinds of Coloring Problem /mmss/coursesONLINE/graph/ 1. Vertex 2. Edge 3. Face Vertex Coloring A simple graph is said to be k?colorable if its vertices can be colored using up to k different colors in such a way that each vertex is of a single color and any two adjacent vertices have different colors. χ(G)=k 【定理 】 当且仅当G是零图。 【定理 】 【定理 】 设G中至少含一条边，则 当且仅当G为二部图。 χ(G)=1 χ(Kn)=n χ(G)=2 Vertex Coloring /mmss/coursesONLINE/graph/ Theorem If every vertex of G has degree d(v) k, then G is k-colorable. Proof: Use induction on n (number of vertices). If n = 1 or n = 2, the assertion is easily seen to be true. Suppose n 2, and assume that the proposition is valid for all graphs with fewer than n vertices. Choose any vertex v of G and delete it and all the edges incident to v. This leaves a subgraph H of G with n - 1 vertices satisfying the given hypothesis (i.e. that every vertex has degree less than k). By the inductive hypothesis, ?(H) ? k. Now, consider any particular k-coloring of H. Since d(v) k, the vertices of H that were adjacent to v in G are colored with at most k ? 1 different colors. Thus, there’s at least one color left with which we may color v, so that it is of a different color to each of its neighbors. This gives a coloring of G using the same colors as H. Therefore, G is k-colorable. Vertex Coloring /mmss/coursesONLI