Pólya's permanent problem

zbMATH Open1062.05066MaRDI QIDQ1773170FDOQ1773170

Authors: William McCuaig 

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• A Problem of Pólya
• Solution of the Polya problem
• The Pólya-Tchebotaröv problem
• Pólya, Problem Solving, and Education
• scientific article; zbMATH DE number 1555476
• The Polaron problem

zbMATH Keywords

bracesign-nonsingular matrixPfaffian orientationsunbalanced edge-weighting

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Exact enumeration problems, generating functions (05A15) Determinants, permanents, traces, other special matrix functions (15A15)

Cited In (67)

• Excluding a planar matching minor in bipartite graphs
• Lower bounds for Pólya's problem on permanent
• Minimal braces
• Shortest odd paths in undirected graphs with conservative weight functions
• Title not available (Why is that?)
• Even circuits in oriented matroids
• Colouring non-even digraphs
• Removable and forced subgraphs of graphs
• Determinants and permanents of power matrices
• Spanning galaxies in digraphs
• Enumeration of perfect matchings of the Cartesian products of graphs
• Odd \(K_{3,3}\) subdivisions in bipartite graphs
• Synchronizing Boolean networks asynchronously
• Title not available (Why is that?)
• On essentially 4-edge-connected cubic bricks
• On spanning galaxies in digraphs
• Computing the permanent of the Laplacian matrices of nonbipartite graphs
• The carbuncle phenomenon is incurable
• Computing maximal autarkies with few and simple oracle queries
• Kräuter conjecture on permanents is true
• On the even permutation polytope
• The characteristic polynomial and the matchings polynomial of a weighted oriented graph
• Generating bricks
• Complexity of fixed point counting problems in Boolean networks
• Minimally non-Pfaffian graphs
• Dimers on the \(3^3 . 4^2\) lattice
• 2-extendability of toroidal polyhexes and Klein-bottle polyhexes
• Latin trades in groups defined on planar triangulations
• Permanents, Pfaffian orientations, and even directed circuits
• The Pfaffian property of Cayley graphs on dihedral groups
• A generalization of Little's theorem on Pfaffian orientations
• A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs
• The Pfaffian property of graphs on the Möbius strip based on topological resolution
• Thin edges in braces
• Computing the inertia from sign patterns
• Matching signatures and Pfaffian graphs
• Solving linear programs from sign patterns
• Sign-solvable linear complementarity problems
• The number of matrices with nonzero permanent over a finite field
• On the permanental polynomials of matrices
• Replacing Pfaffians and applications
• The Pfaffian property of circulant graphs
• Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
• On the rank of a real skew symmetric matrix described by an oriented graph
• Graph characterization of fully indecomposable nonconvertible \((0, 1)\)-matrices with minimal number of ones
• Enumeration of perfect matchings of a type of Cartesian products of graphs
• A quadratic identity for the number of perfect matchings of plane graphs
• On the Gibson barrier for the Pólya problem
• Pólya convertibility problem for symmetric matrices
• On the Pólya conversion problem for permanents and determinants
• A sufficient condition for Pfaffian graphs on the torus
• Face-width of Pfaffian braces and polyhex graphs on surfaces
• \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks
• An identity between the determinant and the permanent of Hessenberg-type matrices
• A conjecture of Norine and Thomas for abelian Cayley graphs
• Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
• Even cycles and perfect matchings in claw-free plane graphs
• An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs
• Packing directed circuits exactly
• Pfaffian graphs embedding on the torus
• Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians
• Recognizing near-bipartite Pfaffian graphs in polynomial time
• Matching theory and Barnette's conjecture
• \( \pm 1\)-matrices with vanishing permanent
• Colouring non-even digraphs
• Pfaffian polyominos on the Klein bottle
• Color-blind index in graphs of very low degree

This page was built for publication: Pólya's permanent problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1773170)