The incidence chromatic number of G is the least number of colors such that G has an incidence coloring. It is proved that the incidence chromatic number of Cn^p, the p-th power of the circuit graph, is 2p ＋ 1 if and...The incidence chromatic number of G is the least number of colors such that G has an incidence coloring. It is proved that the incidence chromatic number of Cn^p, the p-th power of the circuit graph, is 2p ＋ 1 if and only if n = k（2p ＋ 1）, for other cases： its incidence chromatic number is at most 2p ＋ [r/k] ＋ 2, where n = k（p ＋ 1） ＋ r, k is a positive integer. This upper bound is tight for some cases.展开更多
Let G be arbitrary finite group,define H G· (t;p +,p) to be the generating function of G-wreath double Hurwitz numbers.We prove that H G· (t;p +,p) satisfies a differential equation called the colored cutand...Let G be arbitrary finite group,define H G· (t;p +,p) to be the generating function of G-wreath double Hurwitz numbers.We prove that H G· (t;p +,p) satisfies a differential equation called the colored cutand-join equation.Furthermore,H G·(t;p +,p) is a product of several copies of tau functions of the 2-Toda hierarchy,in independent variables.These generalize the corresponding results for ordinary Hurwitz numbers.展开更多
基金Supported by NSFC(10201022,10571124,10726008)Supported by SRCPBMCE(KM200610028002)Supported by BNSF(1012003)
文摘The incidence chromatic number of G is the least number of colors such that G has an incidence coloring. It is proved that the incidence chromatic number of Cn^p, the p-th power of the circuit graph, is 2p ＋ 1 if and only if n = k（2p ＋ 1）, for other cases： its incidence chromatic number is at most 2p ＋ [r/k] ＋ 2, where n = k（p ＋ 1） ＋ r, k is a positive integer. This upper bound is tight for some cases.
基金supported by National Natural Science Foundation of China(Grant Nos.10425101,10631050)National Basic Research Program of China(973Project)(Grant No.2006cB805905)
文摘Let G be arbitrary finite group,define H G· (t;p +,p) to be the generating function of G-wreath double Hurwitz numbers.We prove that H G· (t;p +,p) satisfies a differential equation called the colored cutand-join equation.Furthermore,H G·(t;p +,p) is a product of several copies of tau functions of the 2-Toda hierarchy,in independent variables.These generalize the corresponding results for ordinary Hurwitz numbers.
