Erdős Problem #1176 — Edge Colorings and Monochromatic Vertex Classes
Statement
Let be a graph with chromatic cardinal . Is there an edge-coloring of using exactly colors such that, for every vertex-coloring using at most countably many colors, some vertex-color class contains an edge of every edge color? More precisely, does there exist an edge-color set of cardinality and a coloring of the edges of by such that, for every vertex-color set with cardinality at most and every vertex-coloring , there is a color for which, for every edge color , some adjacent vertices satisfy and ?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.