Is there a constructive way to generate a graph with a fixed min cut equal to $k$?One approach is to generate a random graph and then try to make edges alterations (additions, deletions, swaps) to get the desired min cut -- but I am wondering if there is a more systematic procedure?Ideally I would want to generate a random instance of a graph with min-cut=$k$, and I would want it to be bipartite, but insight on any part of this question would be helpful!Thanks in advance!
generate a graph with fixed min cut
graph theory;max flow min cut;bipartite graphs