Excluding Single-Crossing Matching Minors in Bipartite Graphs

Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht

\noindent By a seminal result of Valiant, computing the permanent of $(0,1)$-matrices is, in general, $\#\mathsf{P}$-hard. In 1913 Pólya asked for which $(0,1)$-matrices $A$ it is…