scientific article
From MaRDI portal
Publication:4044717
zbMath0293.15010MaRDI QIDQ4044717
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Convex programming (90C25) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Determinants, permanents, traces, other special matrix functions (15A15) Miscellaneous inequalities involving matrices (15A45) Matrices of integers (15B36)
Related Items
Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs, A general law of large permanent, Cross-ratio degrees and perfect matchings, The m-Bézout bound and distance geometry, Maximum determinant and permanent of sparse 0-1 matrices, Estimates of the function and quotient by Minc-Sathre, Asymptotic expansions and inequalities relating to the gamma function, Hafnians, perfect matchings and Gaussian matrices, Upper bounds on the numbers of 1-factors and 1-factorizations of hypergraphs, Permanents, max algebra and optimal assignment, Maximum permanents of matrices of zeros and ones, Colorings with few colors: counting, enumeration and combinatorial bounds, Counting and packing Hamilton cycles in dense graphs and oriented graphs, Graph factors and factorization: 1985--2003: a survey, New upper bounds for the number of embeddings of minimally rigid graphs, Brunn--Minkowski inequalities for contingency tables and integer flows, Results and questions on matchings in abelian groups and vector subspaces of fields, Asymptotics of the upper matching conjecture, Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\), Comparison of permanental bounds of \((0,1)\)-matrices, The number of Hamiltonian decompositions of regular graphs, Generalization of a Hadamard type inequality for permanents, Substructures in Latin squares, Perfect matchings in random subgraphs of regular bipartite graphs, Perfect matchings and derangements on graphs, Connected cubic graphs with the maximum number of perfect matchings, Hamilton transversals in random Latin squares, An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs, Entropy bounds for perfect matchings and Hamiltonian cycles, Permanents of multidimensional matrices: Properties and applications, Large deviations in random latin squares, Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor, Matrices of zeros and ones with fixed row and column sum vectors, Concentration of the mixed discriminant of well-conditioned matrices, New permanental bounds for Ferrers matrices, A lower bound on the maximum permanent in \(\Lambda_{n}^{k}\)., Asymptotics for Shamir's problem, Maximum permanents on certain classes of nonnegative matrices, Problems and results in extremal combinatorics. I., Enumerating the edge-colourings and total colourings of a regular graph, An upper bound for the permanent of \((0,1)\)-matrices., On the vertices of the \(d\)-dimensional Birkhoff polytope, Unnamed Item, Randomly colouring graphs (a combinatorial view), Number of 1-factorizations of regular high-degree graphs, Bounding the number of cycles in a graph in terms of its degree sequence, Statistical Matching Theory, Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges, An upper bound on the number of high-dimensional permutations, Permanental bounds of the Laplacian matrix of trees with given domination number, A proof of the upper matching conjecture for large graphs, Notes on use of generalized entropies in counting, On the numbers of 1-factors and 1-factorizations of hypergraphs, On the number of \(r\)-matchings in a tree, Matching theory -- a sampler: From Dénes König to the present, An upper bound for permanents of nonnegative matrices, Enumerating extensions of mutually orthogonal Latin squares, An update on Minc's survey of open problems involving permanents, An asymptotic expansion and recursive inequalities for the monomer-dimer problem, Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices, Permanental bounds for nonnegative matrices via decomposition, Clique matchings in the \(k\)-ary \(n\)-dimensional cube, The combinatorics of a three-line circulant determinant, Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations, On packing Hamilton cycles in \(\varepsilon\)-regular graphs, Some structurological remarks on a nonlocal field, Hamiltonian cycles in Dirac graphs, The maximum number of Hamiltonian paths in tournaments, On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs, Tight bounds on the coefficients of partition functions via stability, An approximation algorithm for counting contingency tables, On the number of Sudoku squares, A short proof of Minc's conjecture, Streaming Algorithms for Selection and Approximate Sorting, Permanent, determinant, and rank of bi-block graphs, On the validations of the asymptotic matching conjectures, On the threshold problem for Latin boxes, Permanents of d-dimensional matrices, Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs, Matchings and independent sets of a fixed size in regular graphs, New permanent approximation inequalities via identities, Multidimensional Permanents and an Upper Bound on the Number of Transversals in Latin Squares, Tight bounds on the coefficients of partition functions via stability, Bounds on the number of Eulerian orientations, Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum, A max version of the Perron-Frobenius theorem, A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I, On maximum number of minimal dominating sets in graphs, A Tight Analysis of Bethe Approximation for Permanent, A New Lower Bound for the Number of Switches in Rearrangeable Networks
