Efficient enumeration of graceful permutations
Abstract
A graceful n-permutation is a graceful labeling of an n-vertex path Pn. In this paper we improve the asymptotic lower bound on the number of such permutations from (5/3)n to 2.37n. This is a computer-assisted proof based on an effective algorithm that enumerates graceful n-permutations. Our algorithm is also presented in detail.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.