Maximum cut, what is and what isn't? !enter image description here Was wondering how is this a maximum cut? For example, isn't there a cut of 6 as oppose to 5?

It could only be possible to cut every edge if the graph is bipartite (the cut itself would give the vertex bipartition). The given example is not a bipartite graph (e.g. it contains a $K_3$).