Pólya's permanent problem
From MaRDI portal
Publication:1773170
zbMath1062.05066MaRDI QIDQ1773170
Publication date: 25 April 2005
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/124596
Exact enumeration problems, generating functions (05A15) Determinants, permanents, traces, other special matrix functions (15A15) Directed graphs (digraphs), tournaments (05C20)
Related Items
Complexity of fixed point counting problems in Boolean networks, An identity between the determinant and the permanent of Hessenberg-type matrices, Dimers on the \(3^3 . 4^2\) lattice, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, On the even permutation polytope, Kräuter conjecture on permanents is true, Even circuits in oriented matroids, Computing Maximal Autarkies with Few and Simple Oracle Queries, A quadratic identity for the number of perfect matchings of plane graphs, Replacing Pfaffians and applications, Generating bricks, The number of matrices with nonzero permanent over a finite field, Finding a path with two labels forbidden in group-labeled graphs, Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem, Computing the inertia from sign patterns, A conjecture of Norine and Thomas for abelian Cayley graphs, Pfaffian graphs embedding on the torus, On the Gibson barrier for the Pólya problem, Thin edges in braces, A generalization of Little's theorem on Pfaffian orientations, A sufficient condition for Pfaffian graphs on the torus, The Pfaffian property of graphs on the Möbius strip based on topological resolution, Minimal braces, Even cycles and perfect matchings in claw-free plane graphs, A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs, Synchronizing Boolean networks asynchronously, On spanning galaxies in digraphs, Matching signatures and Pfaffian graphs, Excluding a planar matching minor in bipartite graphs, The characteristic polynomial and the matchings polynomial of a weighted oriented graph, The Pfaffian property of Cayley graphs on dihedral groups, Pólya convertibility problem for symmetric matrices, On the rank of a real skew symmetric matrix described by an oriented graph, \( \pm 1\)-matrices with vanishing permanent, Enumeration of perfect matchings of the Cartesian products of graphs, Pfaffian polyominos on the Klein bottle, On the Pólya conversion problem for permanents and determinants, Solving linear programs from sign patterns, Sign-solvable linear complementarity problems, The Pfaffian property of circulant graphs, Packing directed circuits exactly, Computing the permanent of the Laplacian matrices of nonbipartite graphs, Face-width of Pfaffian braces and polyhex graphs on surfaces, An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs, Minimally non-Pfaffian graphs, Color-blind index in graphs of very low degree, Recognizing near-bipartite Pfaffian graphs in polynomial time, Unnamed Item, On essentially 4-edge-connected cubic bricks, 2-extendability of toroidal polyhexes and Klein-bottle polyhexes, On the permanental polynomials of matrices, Graph characterization of fully indecomposable nonconvertible (0, 1)-matrices with minimal number of ones, \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks, Lower bounds for Pólya’s problem on permanent, Latin trades in groups defined on planar triangulations, Spanning galaxies in digraphs, Colouring non-even digraphs, Matching theory and Barnette's conjecture, Enumeration of perfect matchings of a type of Cartesian products of graphs, DETERMINANTS AND PERMANENTS OF POWER MATRICES, Odd \(K_{3,3}\) subdivisions in bipartite graphs
