← All problems

Erdős Problem #1174 — Countable Colorings Forcing Monochromatic Cliques

1 year old · traced to

(i) Does there exist a graph GG with no K4K_4 such that every coloring of all unordered pairs of its vertex set with countably many colors contains vertices x,y,zx,y,z whose three pairs are edges of GG and all receive the same color?

(ii) Does there exist a graph GG such that every clique of GG 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?

References

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.