Some work on a problem of Marco Buratti

preprint2015arXivOpen access

Abstract

Marco Buratti's conjecture states that if pp is a prime and LL a multiset containing p−1p-1 non-zero elements from the integers modulo pp, then there exists a Hamiltonian path in the complete graph of order pp with edge lengths in LL. Say that a multiset satisfying the above conjecture is realizable. We generalize the problem for trees, show that multisets can be realized as trees with diameter at least one more than the number of distinct elements in the multiset, and affirm the conjecture for multisets of the form {ϕk(1)a,ϕk(2)b,ϕk(3)c}\{ϕ_k(1)^a, ϕ_k(2)^b, ϕ_k(3)^c\} where ϕk(i)=min⁡{ki(modp),−ki(modp)}ϕ_k(i)=\min\{ki \pmod p, -ki \pmod p\}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.