Efficient enumeration of graceful permutations
Combinatorics
2007-05-23 v1
Abstract
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.
Cite
@article{arxiv.math/0608513,
title = {Efficient enumeration of graceful permutations},
author = {Michal Adamaszek},
journal= {arXiv preprint arXiv:math/0608513},
year = {2007}
}
Comments
5 pages, 1 figure