1
$\begingroup$

What is the largest number of perfect matchings a genus $g$ bipartite graph on $n+m$ vertices have?

$\endgroup$
  • $\begingroup$ Have you tried working out the values for some small values of n or m? $\endgroup$ – Yemon Choi May 1 '16 at 0:40
  • $\begingroup$ $g$ scales with $n$ it is unlikely you get a nice formula so easily $\endgroup$ – Turbo May 1 '16 at 0:42

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.