Status
On this page
Status
Topics
Status
On this page
Status
Topics
Does there exist a graph with no such that every edge colouring of with countably many colours contains a monochromatic ?
Does there exist a graph with no such that every edge colouring of with countably many colours contains a monochromatic ?
Source: erdosproblems.com/1174
No claim settles this problem.
Open. The site labels the problem NOT DISPROVABLE, crediting Shelah with the consistency of a graph with either property. Each of the problem's two parts, which the frontmatter lists, has an accepted consistency result: Shelah's K_4-free graph for the first and Komjáth and Shelah's edge partition theorem for the second. Each settles one side of its part only: relative to the hypotheses it assumes, ZFC does not refute the existence of the graph the part asks for, but neither result shows that ZFC cannot prove its existence. The page departs from the site's label because one side alone leaves a question open, so both parts, and the problem, are open.