推 genghis :感覺是Bipartite graph 10/25 08:41
A cycle in a graph is defined as a path originating and terminating at the
same node. The length of a cycle is the number of edges in the cycle. Show
that there are no odd-length cycles in a d-dimensional hypercube
題目是這樣的
目前以微微薄的知識想說可以用Euler circuit 的定義來證
有歐拉迴路的充分且必要條件是要為連通圖，而且每個頂點的度數都是偶數。
但是現在只是個想法
但是如果要用成數學的是著證明該怎麼下手呢???
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 203.145.206.228