For every number there is a graph with perfect matching

71 Views Asked by At

For every k>=3 integer construct a graph, which have k different perfect matching. How can I do that?