English

Some work on a problem of Marco Buratti

Combinatorics 2015-11-19 v2

Abstract

Marco Buratti's conjecture states that if pp is a prime and LL a multiset containing p1p-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}\{\phi_k(1)^a, \phi_k(2)^b, \phi_k(3)^c\} where ϕk(i)=min{ki(modp),ki(modp)}\phi_k(i)=\min\{ki \pmod p, -ki \pmod p\}.

Keywords

Cite

@article{arxiv.1106.0624,
  title  = {Some work on a problem of Marco Buratti},
  author = {Elliot Krop and Brandi Luongo},
  journal= {arXiv preprint arXiv:1106.0624},
  year   = {2015}
}

Comments

6 pages This paper has been withdrawn due to some mistakes

R2 v1 2026-06-21T18:17:15.971Z