Recently, I asked this question on TCS.SE, but it was closed on the pretext that it was not a research-level question. However, I don't understand what makes it "a not research-level question". It has got 6 upvotes, so at least 6 people find it interesting, and hopefully on-topic, though I know it's not a metric.
I am not asking a "do my homework" question like proving that Max-Cut is NP-complete. I am asking whether there exists a specific reduction, i.e. from Vertex Cover to Max-Cut. I suppose if such a reduction exists, then it might give some insights on how some seemingly unrelated problems are related (and also, reductions are almost always fun!).
So is there anyone else who feels that it's on-topic? Or at least give the specific reason why it was closed, rather than the hand-wavy "not a research-level question".