Abstract
For numbers a ≥ b ≥ l we shall denote by (a, b) the set of numbers b, b + 1, …, a. We shall say that a set S of numbers is perfect if there exists a sequence containing just one pair of each of the numbers in S, satisfying the condition: for every number r in the set, the two r’s are separated by exactly r places, and having no gaps (a perfect sequence).
Publisher
Cambridge University Press (CUP)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On (k, d)-Skolem Graceful Graphs;Electronic Notes in Discrete Mathematics;2015-07
2. Perfect Skolem sets;Discrete Mathematics;2008-05
3. The existence of (p,q)-extended Rosa sequences;Discrete Mathematics;2008-05
4. Note Concerning an Odd Langford Sequence;European Journal of Combinatorics;2001-01
5. The Unity of Combinatorics;Combinatorics Advances;1995