Wild edge colourings of graphs
Džamonja, Mirna ; Komjáth, Péter ; Morgan, Charles
J. Symbolic Logic, Tome 69 (2004) no. 1, p. 255-264 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
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 >μ.
Publié le : 2004-03-14
Classification:  Prikry forcing,  chromatic number,  graph colourings,  03E35,  03E55,  03E75 
@article{1080938840,
     author = {D\v zamonja, Mirna and Komj\'ath, P\'eter and Morgan, Charles},
     title = {Wild edge colourings of graphs},
     journal = {J. Symbolic Logic},
     volume = {69},
     number = {1},
     year = {2004},
     pages = { 255-264},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1080938840}
}

Džamonja, Mirna; Komjáth, Péter; Morgan, Charles. Wild edge colourings of graphs. J. Symbolic Logic, Tome 69 (2004) no. 1, pp.  255-264. http://gdmltest.u-ga.fr/item/1080938840/