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

Similar books and articles

Dominating numbers at singular cardinals.Yusuke Hayashi - 2026 - Archive for Mathematical Logic 65 (4):531-544.
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
436 (#115,817)

6 months
30 (#311,765)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Saharon Shelah, cardinal arithmetic.Saharon Shelah - 1998 - Studia Logica 60 (3):443-448.

Add more references