Wild edge colourings of graphs

Journal of Symbolic Logic 69 (1):255 - 264 (2004)
  Copy   BIBTEX

Abstract

We prove consistent, assuming there is a supercompact cardinal, that there is a singular strong limit cardinal $\mu$ , of cofinality $\omega$ , such that every $\mu^{+}$ -chromatic graph X on $\mu^{+}$ has an edge colouring c of X into $\mu$ colours for which every vertex colouring g of X into at most $\mu$ 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 $\mu^{+}$ is replaced by other cardinals < $\mu$

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,438

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Infinitary logics and very sparse random graphs.James F. Lynch - 1997 - Journal of Symbolic Logic 62 (2):609-623.
Wild edge colourings of graphs.Mirna D.?Amonja, P.�Ter Komj�Th & Charles Morgan - 2004 - Journal of Symbolic Logic 69 (1):255-264.
Twilight graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
On measurable limits of compact cardinals.Arthur W. Apter - 1999 - Journal of Symbolic Logic 64 (4):1675-1688.
Expansions of geometries.John T. Baldwin - 2003 - Journal of Symbolic Logic 68 (3):803-827.

Analytics

Added to PP
2009-01-28

Downloads
267 (#73,630)

6 months
19 (#131,200)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Džamonja Mirna
University of East Anglia

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references