ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let r≥2r\geq 2 and GG be a rr-uniform hypergraph with chromatic number 33 (that is, there is a 33-colouring of the vertices of GG such that no edge is monochromatic). Suppose any two edges of GG have a non-empty intersection. Must GG contain O(r2)O(r^2) many vertices? Must there be two edges which meet in ≫r\gg r 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.