Partitioning the hypercube into smaller hypercubes
From MaRDI portal
Cites work
- A proof of the upper matching conjecture for large graphs
- A short proof of Minc's conjecture
- An entropy proof of Bregman's theorem
- Are hitting formulas hard for resolution?
- Commutative automata networks
- Counting 1-factors in regular bipartite graphs
- Enumerating perfect matchings in n-cubes
- scientific article; zbMATH DE number 3708581 (Why is no real title available?)
- scientific article; zbMATH DE number 3458807 (Why is no real title available?)
- Irreducible subcube partitions
- Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
- Matching theory
- Near perfect coverings in graphs and hypergraphs
- On the number of matchings in regular graphs
- On the number of nearly perfect matchings in almost regular uniform hypergraphs
- Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
- Random methods in design theory: A survey
- The maximum number of Hamiltonian paths in tournaments
- The maximum number of perfect matchings in graphs with a given degree sequence
- The number of perfect matchings in a hypercube
- The probabilistic method
- The solution of van der Waerden's problem for permanents
- Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
- Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all
Cited in
(1)
This page was built for publication: Partitioning the hypercube into smaller hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6977187)