KöMaL 2015 B4742
Show that it is possible to label the edges of a complete graph of vertices with 1, 2 or 3, so that the product of the labels of the edges be different at each vertex.
Official text KöMaL. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.