How can one count the number of graceful labelings of a path graph?
$\begingroup$
$\endgroup$
2
-
3$\begingroup$ in the fifth talk in this list it is conjectured order $\log(n)\log(n−1)\dots \log(2)$ facstaff.unca.edu/pbahls/GGGstuff/2008/… $\endgroup$– Pietro MajerMay 31, 2011 at 8:44
-
$\begingroup$ Nice, thanks. I guess I had thought there would be a closed formula! $\endgroup$– Dr ShelloJun 2, 2011 at 0:43
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
1
An efficient algorithm is described in a paper by Michael Adamaszek which is powerful enough to count the number of graceful labelings of paths up to length 40. It concludes: "It also remains an open question to find an exponential upper bound on [the number of graceful labelings of paths of length n]"
