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