Skip to main content

All Questions

Filter by
Sorted by
Tagged with
7 votes
1 answer
969 views

Graph to Bipartite conversion preserving number of perfect matchings

Given a graph $G$ on $n$ vertices is there a technique to convert to a balanced bipartite graph $B$ with $O(n^c)$ vertices at some fixed $0<c$ in $O(n^{c'})$ time at some fixed $0<c'$ such that ...
Turbo's user avatar
  • 13.9k