第29卷第2期中.PDFVIP

第29 卷第2 期 中 　国 　科 　学 　技 　术 　大 　学 　学 　报 Vol. 29 ,No. 2 1 9 9 9 年 4 月 JOURNAL OF CHINA UNIVERSITY OF SCIENCE AND TECHNOLOGY Apr. 1 9 9 9 A Very Short Proof of Vizing ’s Theorem XU Junming ( ) Department of Mathematics , USTC Abstract 　The classical Vizing’s edgecolouring theorem states that for a loopless multigraph μ Δ Δ μ G of multiplicity and of maximum degree , + colours suffice to colour the edges of G such that adjacent edges have got different colours. A very short proof of the theorem is pre sented. Key words 　multigraphs , edgecolourings , vizing’s theorem AMS Classification( 1991) 　05C15 For all the terminologies and notations used and not defined here we follow [ 1 ]. Let G = ( V ( G) , E ( G) , ψ) be a loopless multigraph of the multiplicity μ( G) , and of the maximum degree G Δ( ) χ( ) G and the edge chromatic number ′G . The classical Vizing ’s theorem can be stated as fol lows. [2 ] Δ( ) χ( ) Δ( ) μ( ) Vizing ’s theorem 　If G is loopless , then G ′G G + G . The lower bound is clear. There are (for example [2 ] ,[3 ] and [4 ]) proofs for the upper bound. However , every one of them contains so many exa