scientific article; zbMATH DE number 3704754

MaRDI QIDQ3897156zbMATH OpenFDO

Authors W. G. Valiant, Alexander Schrijver

Publication date 1980

zbMATH Keywords

Erdős-Renyi conjecture

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Determinants, permanents, traces, other special matrix functions (15A15) Matrices of integers (15B36) Stochastic matrices (15B51)

Cited in

(20)

• A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor
• Combinatorial analysis (nonnegative matrices, algorithmic problems)
• Recurrence formulas for permanents of (0,1)-circulants
• The number of matchings in random regular graphs and bipartite graphs
• Permanents of doubly stochastic matrices
• Permanental compounds and permanents of (0,1)-circulants
• On the number of edge-colourings of regular bipartite graphs
• Approximating the permanent via importance sampling with application to the dimer covering problem
• Counting 1-factors in regular bipartite graphs
• An improved upper bound for the \(3\)-dimensional dimer problem
• Factorially many maximum matchings close to the Erdős-Gallai bound
• An update on Minc's survey of open problems involving permanents
• Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
• Matchings in Benjamini-Schramm convergent graph sequences
• Statistical Matching Theory
• Randomly colouring graphs (a combinatorial view)
• Matchings in vertex-transitive bipartite graphs
• Bounds on the number of Eulerian orientations
• Graph factors and factorization: 1985--2003: a survey
• An improved linear bound on the number of perfect matchings in cubic graphs

This page was built for publication:

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