|
|||||
|
|
An upper bound on the size of the snake-in-the-box |
|
| Authors: | Gilles Zémor |
| Institution: | (1) Network Dept., Ecole Nationale Supérieure des Télécommunications, 46 rue Barrault, 75634 Paris 13, France |
| Abstract: | A snake in a graph is a simple cycle without chords. We give an upper bound on the size of a snake S in then-dimensional cube of the form |S| 2
n–1(1–n
1/2/89+O(1/n)). |
| Keywords: | 05C38 68R10 94B60 94B65 |
| 本文献已被 SpringerLink 等数据库收录！ | |