Can 3-coloring be reduced to 3-clique?
You are correct. 

3-clique can be solved in $O(n^3)$ time, whereas 3-coloring is NP-hard.

So there can be no "poly-time reduction" from 3-coloring to 3-clique, unless $P=NP$.