DOIAbstract
AbstractThe following combinatorial problem, which arose in game theory, is solved here: To find a set of vertices of a given size (in the n-cube) which has a maximal number of interconnecting edges
AbstractThe following combinatorial problem, which arose in game theory, is solved here: To find a set of vertices of a given size (in the n-cube) which has a maximal number of interconnecting edges
AbstractIn this paper, we consider a coloring problem on the n-cube that arises in the study of scal...
Ahlswede R, Aydinian H, Khachatrian LH. Maximum number of constant weight vertices of the unit n-cub...
Let maxζG(m) denote the maximum number of edges in a subgraph of graph G induced by m nodes. The n-d...
AbstractThe following combinatorial problem, which arose in game theory, is solved here: To find a s...
We consider the problem of embedding the n-dimensional cube into a rectangular grid with 2 n verti...
AbstractWe consider the problem of embedding the n-dimensional cube into a rectangular grid with 2n ...
Ahlswede R, Koschnick KU. Note on an extremal problem arising for unreliable networks in parallel co...
Motivated by its relation to the length of cutting plane proofs for the Maximum Biclique problem, we...
Mass data processing and complex problem solving have higher and higher demands for performance of m...
We consider a problem mentioned in [1], which is in partitioning the n-cube in as many sets as possi...
A matchstick graph is a plane graph with edges drawn as unit-distance line segments. Harborth introd...
find the driving-point resistance between two vertices a distance i apart in the n-dimensional cube ...
It is known that for a graph on n vertices bn2/4c + 1 edges is sufficient for the existence of many ...
The k-ary n-cube is one of the most popular interconnection networks for parallel computing. This pa...
AbstractA dominating set for a graph G=(V,E) is a subset of vertices V′⊆V such that for all v∈V−V′ t...
AbstractIn this paper, we consider a coloring problem on the n-cube that arises in the study of scal...
Ahlswede R, Aydinian H, Khachatrian LH. Maximum number of constant weight vertices of the unit n-cub...
Let maxζG(m) denote the maximum number of edges in a subgraph of graph G induced by m nodes. The n-d...
AbstractThe following combinatorial problem, which arose in game theory, is solved here: To find a s...
We consider the problem of embedding the n-dimensional cube into a rectangular grid with 2 n verti...
AbstractWe consider the problem of embedding the n-dimensional cube into a rectangular grid with 2n ...
Ahlswede R, Koschnick KU. Note on an extremal problem arising for unreliable networks in parallel co...
Motivated by its relation to the length of cutting plane proofs for the Maximum Biclique problem, we...
Mass data processing and complex problem solving have higher and higher demands for performance of m...
We consider a problem mentioned in [1], which is in partitioning the n-cube in as many sets as possi...
A matchstick graph is a plane graph with edges drawn as unit-distance line segments. Harborth introd...
find the driving-point resistance between two vertices a distance i apart in the n-dimensional cube ...
It is known that for a graph on n vertices bn2/4c + 1 edges is sufficient for the existence of many ...
The k-ary n-cube is one of the most popular interconnection networks for parallel computing. This pa...
AbstractA dominating set for a graph G=(V,E) is a subset of vertices V′⊆V such that for all v∈V−V′ t...
AbstractIn this paper, we consider a coloring problem on the n-cube that arises in the study of scal...
Ahlswede R, Aydinian H, Khachatrian LH. Maximum number of constant weight vertices of the unit n-cub...
Let maxζG(m) denote the maximum number of edges in a subgraph of graph G induced by m nodes. The n-d...
Add to ORKG