olymmath

JBMO 2012 Problem 3

On a board there are nn nails each two connected by a string. Each string is colored in one of nn given distinct colors. For each three distinct colors, there exist three nails connected with strings in these three colors. Can nn be a) 6 ? b) 7 ?

Dataset text NuminaMath olympiads. Quoted with source.

Also JBMO-SL 2012 C2.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator jbmo/2012/p3 · Tag BJV5CG19VJ · Edit this page on GitHub · Keys: j next, k previous