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$

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 99,462

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

Wild edge colourings of graphs.Mirna D.?Amonja, P.�Ter Komj�Th & Charles Morgan - 2004 - Journal of Symbolic Logic 69 (1):255-264.
A strong polarized relation.Shimon Garti & Saharon Shelah - 2012 - Journal of Symbolic Logic 77 (3):766-776.
Strong tree properties for small cardinals.Laura Fontanella - 2013 - Journal of Symbolic Logic 78 (1):317-333.
Getting more colors I.Todd Eisworth - 2013 - Journal of Symbolic Logic 78 (1):1-16.
Same graph, different universe.Assaf Rinot - 2017 - Archive for Mathematical Logic 56 (7):783-796.
A proof of Shelah's partition theorem.Menachem Kojman - 1995 - Archive for Mathematical Logic 34 (4):263-268.
Getting more colors II.Todd Eisworth - 2013 - Journal of Symbolic Logic 78 (1):17-38.

Analytics

Added to PP
2009-01-28

Downloads
289 (#85,716)

6 months
15 (#164,284)

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