Erdős–Faudree–Gould–Gyárfás–Rousseau–Schelp 2/3 conjecture
Statement
Let be a complete graph whose edges are coloured with three colours. A set of vertices -dominates a vertex if the vertex is joined to at least one member of the set by an edge of colour . Erdős–Faudree–Gould–Gyárfás–Rousseau–Schelp conjecture. There exists a colour and a set of at most vertices that -dominates at least of the vertices of . 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 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.