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