No CrossRef data available.
Article contents
Wild edge colourings of graphs
Published online by Cambridge University Press: 12 March 2014
Abstract
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 > μ.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2004
References
REFERENCES
[1]Džamonja, M. and Shelah, S., Universal graphs at the successor of a singular cardinal, this Journal, vol. 68 (2003), no. 2, pp. 366–388.Google Scholar
[2]Fodor, G., Proof of a conjecture of P. Erdős, Acta Scientiarum Mathematicarum, Universitatis Szegediensis, vol. 14 (1952), pp. 219–227.Google Scholar
[3]Hajnal, A. and Hamburger, P., Set theory, London Mathematical Society Student Texts, vol. 48, Cambridge University Press, 1999.CrossRefGoogle Scholar
[4]Hajnal, A. and Komjáth, P., Some remarks on the simultaneous chromatic number, Paul Erdős and his mathematics (Halász, G., Lovász, L., Simonovits, M., and Sós, V. T., editors), Bolyai Society Mathematical Studies, vol. 10.Google Scholar
[5]Laver, R., Making the supercompactness of κ indestructible under κ-directed closed forcing, Israel Journal of Mathematics, vol. 29 (1978), no. 4, pp. 385–388.CrossRefGoogle Scholar
[7]Todorčević, S., Coloring pairs of countable ordinals, Acta Mathematica, vol. 159 (1987), pp. 261–294.Google Scholar