We present several partial results, variants, and consistency results concerning the following (as yet unsolved) conjecture. If X is a graph on the ground set V with \( Chr{\left( X \right)} = {\aleph }_{1} \) then X has an edge coloring F with \( {\aleph }_{1} \) colors such that if V is decomposed into \( {\aleph }_{0} \) parts then there is one in which F assumes all values.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Due to some unfortunate misunderstandings, this paper appeared much later than we expected.
* Research partially supported by NSF grants DMS-9704477 and DMS-0072560.
† Research partially supported by Hungarian National Research Grant T 032455.