The following pages link to (Q4184837):
Displaying 23 items.
- A superlinear bound on the number of perfect matchings in cubic bridgeless graphs (Q412270) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Matchings in vertex-transitive bipartite graphs (Q502979) (← links)
- Exponentially many perfect matchings in cubic graphs (Q555602) (← links)
- Triangular blocks of zeros in (0,1) matrices with small permanents (Q676040) (← links)
- Bounds on the number of Eulerian orientations (Q787162) (← 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)
- Permanents of doubly stochastic matrices (Q1084155) (← links)
- Matrices of zeros and ones with fixed row and column sum vectors (Q1146695) (← links)
- On the number of edge-colourings of regular bipartite graphs (Q1166536) (← links)
- Counting 1-factors in regular bipartite graphs (Q1386423) (← links)
- The combinatorics of a three-line circulant determinant (Q1766468) (← links)
- Combinatorial analysis. (Matrix problems, choice theory) (Q1837183) (← links)
- Counting near-perfect matchings on \(C_m \times C_n\) tori of odd order in the Maple system (Q2216912) (← links)
- Antiferromagnetic Ising model in triangulations with applications to counting perfect matchings (Q2449125) (← links)
- Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems (Q2628330) (← links)
- Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching (Q2692777) (← links)
- Matchings in Benjamini–Schramm convergent graph sequences (Q2790620) (← links)
- Counting perfect matchings in the geometric dual (Q2840713) (← links)
- Cubic bridgeless graphs have more than a linear number of perfect matchings (Q2851496) (← links)
- Statistical Matching Theory (Q3295266) (← links)
- On Certain Graph Theory Applications (Q3606093) (← links)
