scientific article; zbMATH DE number 3621721
From MaRDI portal
Publication:4184837
Cited in
(25)- A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor
- Permanents of doubly stochastic matrices
- Matrices of zeros and ones with fixed row and column sum vectors
- On the number of edge-colourings of regular bipartite graphs
- Counting 1-factors in regular bipartite graphs
- The combinatorics of a three-line circulant determinant
- Combinatorial analysis. (Matrix problems, choice theory)
- Counting near-perfect matchings on \(C_m \times C_n\) tori of odd order in the Maple system
- Antiferromagnetic Ising model in triangulations with applications to counting perfect matchings
- Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
- Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching
- Matchings in Benjamini-Schramm convergent graph sequences
- Counting perfect matchings in the geometric dual
- Cubic bridgeless graphs have more than a linear number of perfect matchings
- Statistical Matching Theory
- On Certain Graph Theory Applications
- A superlinear bound on the number of perfect matchings in cubic bridgeless graphs
- Randomly colouring graphs (a combinatorial view)
- Matchings in vertex-transitive bipartite graphs
- Exponentially many perfect matchings in cubic graphs
- Triangular blocks of zeros in (0,1) matrices with small permanents
- Experimental results on the number of perfect matchings in graphs of Latin rectangle
- Three-cuts are a charm: acyclicity in 3-connected cubic graphs
- Bounds on the number of Eulerian orientations
- 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 Q4184837)
