The following pages link to (Q3897156):
Displaying 20 items.
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Matchings in vertex-transitive bipartite graphs (Q502979) (← links)
- Bounds on the number of Eulerian orientations (Q787162) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- An improved linear bound on the number of perfect matchings in cubic graphs (Q976154) (← links)
- A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor (Q1016541) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- Recurrence formulas for permanents of (0,1)-circulants (Q1066235) (← links)
- The number of matchings in random regular graphs and bipartite graphs (Q1081621) (← links)
- Permanents of doubly stochastic matrices (Q1084155) (← links)
- Permanental compounds and permanents of (0,1)-circulants (Q1086321) (← links)
- On the number of edge-colourings of regular bipartite graphs (Q1166536) (← links)
- Approximating the permanent via importance sampling with application to the dimer covering problem (Q1282386) (← links)
- Counting 1-factors in regular bipartite graphs (Q1386423) (← links)
- An improved upper bound for the \(3\)-dimensional dimer problem (Q1974841) (← links)
- Factorially many maximum matchings close to the Erdős-Gallai bound (Q2152791) (← links)
- An update on Minc's survey of open problems involving permanents (Q2484497) (← links)
- Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems (Q2628330) (← links)
- Matchings in Benjamini–Schramm convergent graph sequences (Q2790620) (← links)
- Statistical Matching Theory (Q3295266) (← links)
