Skip to main content
MathOverflow
Sanket Biswas's user avatar
Sanket Biswas's user avatar
Sanket Biswas's user avatar
Sanket Biswas
  • Member for 3 years, 4 months
  • Last seen more than a month ago
Profile Activity

9 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions
awarded
 Popular Question
awarded
 Editor
revised
Generalization of Marshall Hall's Theorem to non-simple bipartite graphs
added 31 characters in body
revised
Generalization of Marshall Hall's Theorem to non-simple bipartite graphs
added 9 characters in body
asked
Generalization of Marshall Hall's Theorem to non-simple bipartite graphs
comment
Bipartite graph with exactly one perfect matching
Thanks for this. I have just one question, did you assume $G$ to be a simple bipartite graph, or did you assume it to be any bipartite graph?
awarded
 Supporter
awarded
 Student
asked
Bipartite graph with exactly one perfect matching