In the paper, we prove that the edge number of the Subgraph with maximal edge number of cube graph is equal to the number of 1 in (0,1)-string all integers between 1 and its verter number.
本文中，我们证明了立方图的极大边数子图的边数等于从1到它的点数之间所有正整数的（0，1）——串表示中1的个数。
How long can the longest edge of the cube be?
这个正方体的棱长最大是多少厘米？
应用推荐