免费模板-nctu.edu.tw.ppt

参考文献 [1] S.H. Hedetniemi, Homeomorphisms of graphs and automata, University of Michigan Technical Report 03105-44-T, 1966. [2] Xuding Zhu,A SURVEY ON HEDETNIEMIS CONJECTURE, TAIWANESE JOURNAL OF MATHEMATICS Vol. 2, No. 1, pp. 1-24, March 1998. [3] Claude Tardif, Hedetniemi’s conjecture,40 years later,Graph Theory Notes of New York LiV,46-57(2008),New York Academy of Science. [4] Ayongga and Siqin,Journal of Baoji University of Arts and Sciences (Natural Science) ,VoL 29 ,No.1 , pp. 1-3 ,Mar. 2009 [5] 张国元，阿勇嘎，直积图的分数色数，内蒙古师大学报， 2011年第1期. [6] Xuding Zhu, The fractional version of Hedetniemi’s?conjecture ?is true, European Journal of Combinatorics, Available online 13 April 2011. [7] Siqin Ayongga, Hedetniemi’s Conjecture on the Maximum expansion graphs, Preprint. The end Thanks for your attention ! Hedetniemi’s?conjecture?is true on the some expansion transformation of the graph. 图在扩容变换下的Hedetniemi 猜想 2011年6月 AYongga阿勇嘎 Mathematics Science College Inner Mongolia Normal University, Huhhot Abstract This paper introduces the expansion transformation of the graph and maximum expansion graph at first .Then proves that?Hedetniemi’s?conjecture?is true (1)?? on the infinite maximum expansion classes of the graph ; (2)???on the some expansion transformation of the graph. Keywords：Expansion graph 一、研究背景 二、主要结论 三、参考文献 1、1966年 Hedetniemi 提出： Conjecture . For any finite simple graphs and 2、1998年 朱绪鼎教授给出了有关研究综述： A SURVEY ON HEDETNIEMIS CONJECTURE More than 30 years ago, Hedetniemi made a conjecture which says that the categorical product of two n-chromatic graphs is still n-chromatic. The conjecture is still open, despite many dierent approaches from dierent point of views. This article surveys methods and partial results; and discuss problems related to or motivated by this conjecture. 3、2008年Claude 给出的一篇综述： Hedeniemi’s conjecture states that the chromatic number of a