First time here? Check out the FAQ!
asked 9 years ago
How can I check existence of a complete SDR in a bipartite graph ?
This will be done by checking if there is a perfect matching in the graph(Hall's marriage theorem), but How can I implement this in SAGE?