Erdős Problem #1174 — Countable Colorings Forcing Monochromatic Cliques
(i) Does there exist a graph with no such that every coloring of all unordered pairs of its vertex set with countably many colors contains vertices whose three pairs are edges of and all receive the same color?
(ii) Does there exist a graph such that every clique of is countable and every coloring of all unordered pairs of its vertex set with countably many colors contains an infinite clique all of whose pairs receive the same color?
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.