ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a complete graph whose edges are coloured with three colours. A set of vertices cc-dominates a vertex if the vertex is joined to at least one member of the set by an edge of colour cc. Erdős–Faudree–Gould–Gyárfás–Rousseau–Schelp conjecture. There exists a colour cc and a set of at most 33 vertices that cc-dominates at least 2/32/3 of the vertices of GG. This conjecture asks for the sharp bound suggested by Kierstead's three-colouring construction, which shows that a small set cannot be guaranteed to monochromatically dominate significantly more than 2/32/3 of the vertices. The supplied source does not state whether the conjecture has been resolved.

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.