converting a graph to a bipartite graph subject to bipartite graph has at least 3e/4 edge of input graph

Question

given a graph in input and we want convert this graph to a bipartite graph subject to bipartite graph has at least 3e/4 edges of input graph. I know a random algorithm with expe