N Coloring Problem. By using a set of n flexible rods one can arrange that every rod touches every other rod. There is no obvious extension of the coloring result to three-dimensional solid regions. The set would then require n colors or n1 if you consider the empty space that also touches every rod.
By using a set of n flexible rods one can arrange that every rod touches every other rod. There is no obvious extension of the coloring result to three-dimensional solid regions. The set would then require n colors or n1 if you consider the empty space that also touches every rod.
There is no obvious extension of the coloring result to three-dimensional solid regions.
There is no obvious extension of the coloring result to three-dimensional solid regions. The set would then require n colors or n1 if you consider the empty space that also touches every rod. By using a set of n flexible rods one can arrange that every rod touches every other rod. There is no obvious extension of the coloring result to three-dimensional solid regions.
