Wild edge colourings of graphs
暂无分享,去创建一个
We prove consistent, assuming there is a supercompact cardinal, that there is a singular strong limit cardinal μ , of cofinality ω , such that every μ + -chromatic graph X on μ + has an edge colouring c of X into μ colours for which every vertex colouring g of X into at most μ many colours has a g -colour class on which c takes every value. The paper also contains some generalisations of the above statement in which μ + is replaced by other cardinals > μ .
[1] Stevo Todorcevic,et al. Partitioning pairs of countable ordinals , 1987 .
[2] Richard Laver,et al. Making the supercompactness of κ indestructible under κ-directed closed forcing , 1978 .
[3] Saharon Shelah,et al. Universal graphs at the successor of a singular cardinal , 2001, Journal of Symbolic Logic.
[4] Péter Komjáth,et al. Some Remarks on the Simultaneous Chromatic Number , 2003, Comb..