Erdős Problem #836 — Let r≥ 2 and G be a r-uniform hypergraph with chromatic number 3 (that is, there is a 3-colouring of the vertices of G such that no edge is monochromatic).
Statement
Let and be a -uniform hypergraph with chromatic number (that is, there is a -colouring of the vertices of such that no edge is monochromatic). Suppose any two edges of have a non-empty intersection. Must contain many vertices? Must there be two edges which meet in many vertices?
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.