Abstract
A sequence (ai) of integers is well-spread if the sums a i + aj, for i < j, are all different. For a fixed positive integer r, let Wr(N) denote the maximum integer n for which there exists a well-spread sequence 0 ≤ a1 < ⋯ < an ≤ N with ai ≡ aj (mod r) for all i, j. We give a new proof that Wr(N) < Λ(n) < 2n2 + O(n61/40). © 2004 Discrete Mathematics and Theoretical Computer Science (DMTCS).
Author supplied keywords
Cite
CITATION STYLE
APA
Kayll, P. M. (2004). Well-spread sequences and edge-labellings with constant Hamilton-weight. Discrete Mathematics and Theoretical Computer Science, 6(2), 401–408. https://doi.org/10.46298/dmtcs.324
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free