scientific article
From MaRDI portal
Publication:3897156
zbMath0451.15009MaRDI QIDQ3897156
W. G. Valiant, Alexander Schrijver
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Determinants, permanents, traces, other special matrix functions (15A15) Combinatorial inequalities (05A20) Matrices of integers (15B36) Stochastic matrices (15B51)
Related Items (20)
The number of matchings in random regular graphs and bipartite graphs ⋮ Permanents of doubly stochastic matrices ⋮ Permanental compounds and permanents of (0,1)-circulants ⋮ Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems ⋮ Factorially many maximum matchings close to the Erdős-Gallai bound ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Counting 1-factors in regular bipartite graphs ⋮ On the number of edge-colourings of regular bipartite graphs ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Statistical Matching Theory ⋮ An improved upper bound for the \(3\)-dimensional dimer problem ⋮ Matchings in vertex-transitive bipartite graphs ⋮ An update on Minc's survey of open problems involving permanents ⋮ An improved linear bound on the number of perfect matchings in cubic graphs ⋮ Matchings in Benjamini–Schramm convergent graph sequences ⋮ A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor ⋮ Approximating the permanent via importance sampling with application to the dimer covering problem ⋮ Bounds on the number of Eulerian orientations ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems) ⋮ Recurrence formulas for permanents of (0,1)-circulants
This page was built for publication:
