We know that finding a max cut for weighted graphs is NP-Complete. I am trying to find a proof showing that even for graphs with just unit weights (every edge has weight 1) it is still NP-Complete. I've looked at the proofs reducing 3 NAESAT and vertex cover problems to max cut. But in those proofs we get weighted graphs for which we find max cuts. If someone could point me in the right direction I would appreciate it.
Yes, Max-Cut is still NP-complete in unweighted graphs.
This is explained in pretty much every survey article on tthe Max-Cut problem, and in many texbooks (as for instance "Computational Complexity" by C.H. Papadimitriou). The first proof goes back to the year 1976:
M.R. Garey, D.S. Johnson, L. Stockmeyer
Some simplified NP-complete graph problems
Theoretical Computer Science 1 (1976), pp 237-267