Original sentence: In combinatorial mathematics, the ménage problem or problème des ménages asks for the number of different ways in which it is possible to seat a set of married couples at a dining table so that men and women alternate and nobody sits next to his or her spouse.This graph is formed by removing the perfect matching formed by the married couples from a complete bipartite graph that connects every man to every woman
Edited sentence: In combinatorial mathematics, the ménage problem or problème des ménages asks for the number of different ways in which it is possible to seat a set of heterosexual couples at a dining table so that men and women alternate and nobody sits next to his or her partner.This graph is formed by removing the perfect matching formed by the heterosexual couples from a complete bipartite graph that connects every man to every woman