Efficient enumeration of graceful permutations
| dc.creator | Adamaszek, Michal | |
| dc.date | 2006-08-21 | |
| dc.date.accessioned | 2026-07-07T07:21:59Z | |
| dc.date.available | 2026-07-07T07:21:59Z | |
| dc.description | A graceful n-permutation is a graceful labeling of an n-vertex path P_n. In this paper we improve the asymptotic lower bound on the number of such permutations from (5/3)^n to 2.37^n. This is a computer-assisted proof based on an effective algorithm that enumerates graceful n-permutations. Our algorithm is also presented in detail. | |
| dc.description | 5 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/math/0608513 | |
| dc.identifier | http://arxiv.org/abs/math/0608513 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/115497 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C78 (Primary), 11Y55 (Secondary) | |
| dc.title | Efficient enumeration of graceful permutations | |
| dc.type | text |