The following pages link to (Q4044717):
Displaying 50 items.
- Estimates of the function and quotient by Minc-Sathre (Q298791) (← links)
- Hafnians, perfect matchings and Gaussian matrices (Q317488) (← links)
- Upper bounds on the numbers of 1-factors and 1-factorizations of hypergraphs (Q322196) (← links)
- Counting and packing Hamilton cycles in dense graphs and oriented graphs (Q345082) (← links)
- Asymptotics of the upper matching conjecture (Q385029) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges (Q482134) (← links)
- An upper bound on the number of high-dimensional permutations (Q485003) (← links)
- Permanental bounds of the Laplacian matrix of trees with given domination number (Q497337) (← links)
- Notes on use of generalized entropies in counting (Q503654) (← links)
- On the numbers of 1-factors and 1-factorizations of hypergraphs (Q507504) (← links)
- On the number of \(r\)-matchings in a tree (Q510338) (← links)
- An asymptotic expansion and recursive inequalities for the monomer-dimer problem (Q540587) (← links)
- Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices (Q543906) (← links)
- Clique matchings in the \(k\)-ary \(n\)-dimensional cube (Q546220) (← links)
- An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs (Q620956) (← links)
- Entropy bounds for perfect matchings and Hamiltonian cycles (Q624182) (← links)
- New permanental bounds for Ferrers matrices (Q636241) (← links)
- New permanent approximation inequalities via identities (Q779828) (← links)
- Bounds on the number of Eulerian orientations (Q787162) (← links)
- A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I (Q801133) (← links)
- Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs (Q820917) (← links)
- The m-Bézout bound and distance geometry (Q831957) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Brunn--Minkowski inequalities for contingency tables and integer flows (Q876322) (← links)
- Concentration of the mixed discriminant of well-conditioned matrices (Q905709) (← links)
- Maximum permanents on certain classes of nonnegative matrices (Q913888) (← links)
- Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations (Q976091) (← links)
- Hamiltonian cycles in Dirac graphs (Q987558) (← links)
- On the validations of the asymptotic matching conjectures (Q1012650) (← links)
- Matchings and independent sets of a fixed size in regular graphs (Q1040835) (← links)
- Maximum permanents of matrices of zeros and ones (Q1104376) (← links)
- Matrices of zeros and ones with fixed row and column sum vectors (Q1146695) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Some structurological remarks on a nonlocal field (Q1231307) (← links)
- A short proof of Minc's conjecture (Q1251262) (← links)
- Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum (Q1301841) (← links)
- A max version of the Perron-Frobenius theorem (Q1307193) (← links)
- Comparison of permanental bounds of \((0,1)\)-matrices (Q1392571) (← links)
- A lower bound on the maximum permanent in \(\Lambda_{n}^{k}\). (Q1414135) (← links)
- Problems and results in extremal combinatorics. I. (Q1417566) (← links)
- An upper bound for the permanent of \((0,1)\)-matrices. (Q1418984) (← links)
- The number of Hamiltonian decompositions of regular graphs (Q1686305) (← links)
- Permanental bounds for nonnegative matrices via decomposition (Q1765888) (← links)
- The combinatorics of a three-line circulant determinant (Q1766468) (← links)
- On packing Hamilton cycles in \(\varepsilon\)-regular graphs (Q1775898) (← links)
- On the number of Sudoku squares (Q1783641) (← links)
- Permanents of d-dimensional matrices (Q1820218) (← links)
- Permanents, max algebra and optimal assignment (Q1899397) (← links)
- Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\) (Q1926033) (← links)
