scientific article; zbMATH DE number 3621721
From MaRDI portal
Publication:4184837
zbMath0401.05005MaRDI QIDQ4184837
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Permutations, words, matrices (05A05) Determinants, permanents, traces, other special matrix functions (15A15)
Related Items (23)
Permanents of doubly stochastic matrices ⋮ Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems ⋮ Counting 1-factors in regular bipartite graphs ⋮ A superlinear bound on the number of perfect matchings in cubic bridgeless graphs ⋮ Matrices of zeros and ones with fixed row and column sum vectors ⋮ Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching ⋮ On the number of edge-colourings of regular bipartite graphs ⋮ Randomly colouring graphs (a combinatorial view) ⋮ 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 ⋮ Statistical Matching Theory ⋮ Matchings in vertex-transitive bipartite graphs ⋮ Triangular blocks of zeros in (0,1) matrices with small permanents ⋮ The combinatorics of a three-line circulant determinant ⋮ An improved linear bound on the number of perfect matchings in cubic graphs ⋮ Exponentially many perfect matchings in cubic graphs ⋮ Matchings in Benjamini–Schramm convergent graph sequences ⋮ On Certain Graph Theory Applications ⋮ A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor ⋮ Counting perfect matchings in the geometric dual ⋮ Combinatorial analysis. (Matrix problems, choice theory) ⋮ Bounds on the number of Eulerian orientations ⋮ Cubic bridgeless graphs have more than a linear number of perfect matchings
This page was built for publication:
