We consider a problem mentioned in [1], which is in partitioning the n-cube in as many sets as possible, such that two different sets always have distance one
We study nested partitions of Rd obtained by successive cuts us-ing hyperplanes with fixed direction...
The best known estimate for the packing of points into the 6-dimensional unit cube in mutual distanc...
AbstractA proof is given of the (known) result that, if real n-dimensional Euclidean space Rn is cov...
We consider a problem mentioned in [1], which is in partitioning the n-cube in as many sets as possi...
AbstractA K-partition of a set S is a splitting of S into K non-overlapping classes that cover all e...
International audienceA -partition of a set is a splitting of into non-overlapping classes that cove...
AbstractA method is developed to investgate the minimum number of subsets that n-dimensional Euclide...
Let m = m (n) denote the smallest dimension m such that the vertices of the n-dimensional cube can b...
Many interesting problems in Discrete and Computational Geometry involve partitioning. A main questi...
The problem of partitioning a graph into two sets of nodes such that the sets have a certain propert...
. Let an edge cut partition the vertex set of the n-cube into k subsets A1 ; :::; Ak with jjA i j \...
AbstractWe consider the minimum number of cliques needed to partition the edge set of D(G), the dist...
. Let an edge cut partition the vertex set of the n-cube into k subsets A1 ; :::; Ak with jjA i j \...
AbstractThe following combinatorial problem, which arose in game theory, is solved here: To find a s...
In 1933, Borsuk made a conjecture that every $n$-dimensional bounded set can be divided into $n+1$ s...
We study nested partitions of Rd obtained by successive cuts us-ing hyperplanes with fixed direction...
The best known estimate for the packing of points into the 6-dimensional unit cube in mutual distanc...
AbstractA proof is given of the (known) result that, if real n-dimensional Euclidean space Rn is cov...
We consider a problem mentioned in [1], which is in partitioning the n-cube in as many sets as possi...
AbstractA K-partition of a set S is a splitting of S into K non-overlapping classes that cover all e...
International audienceA -partition of a set is a splitting of into non-overlapping classes that cove...
AbstractA method is developed to investgate the minimum number of subsets that n-dimensional Euclide...
Let m = m (n) denote the smallest dimension m such that the vertices of the n-dimensional cube can b...
Many interesting problems in Discrete and Computational Geometry involve partitioning. A main questi...
The problem of partitioning a graph into two sets of nodes such that the sets have a certain propert...
. Let an edge cut partition the vertex set of the n-cube into k subsets A1 ; :::; Ak with jjA i j \...
AbstractWe consider the minimum number of cliques needed to partition the edge set of D(G), the dist...
. Let an edge cut partition the vertex set of the n-cube into k subsets A1 ; :::; Ak with jjA i j \...
AbstractThe following combinatorial problem, which arose in game theory, is solved here: To find a s...
In 1933, Borsuk made a conjecture that every $n$-dimensional bounded set can be divided into $n+1$ s...
We study nested partitions of Rd obtained by successive cuts us-ing hyperplanes with fixed direction...
The best known estimate for the packing of points into the 6-dimensional unit cube in mutual distanc...
AbstractA proof is given of the (known) result that, if real n-dimensional Euclidean space Rn is cov...
DOI
Add to ORKG