The carvingwidth of hypercubes |
| |
| Authors: | L. Sunil Chandran |
| |
| Affiliation: | Computer Science and Automation Department, Indian Institute of Science, Bangalore 560012, India |
| |
| Abstract: | The notion of the carvingwidth of a graph was introduced by Seymour and Thomas [Call routing and the ratcatcher, Combinatorica 14 (1994) 217-241]. In this note, we show that the carvingwidth of a d-dimensional hypercube equals 2d-1. |
| |
| Keywords: | Carvingwidth Hypercube Discrete isoperimetric inequalities |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
