A new result on the problem of Buratti, Horak and Rosa
From MaRDI portal
Publication:394341
DOI10.1016/J.DISC.2013.11.017zbMATH Open1281.05090arXiv1305.6482OpenAlexW2018692958MaRDI QIDQ394341FDOQ394341
Authors: Anita Pasotti, Marco Antonio Pellegrini 
Publication date: 27 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: The conjecture of Peter Horak and Alex Rosa (generalizing that of Marco Buratti) states that a multiset L of v-1 positive integers not exceeding [v/2] is the list of edge-lengths of a suitable Hamiltonian path of the complete graph with vertex-set {0,1,...,v-1} if and only if the following condition (here reformulated in a slightly easier form) is satisfied: for every divisor d of v, the number of multiples of d appearing in L is at most v-d. In this paper we do some preliminary discussions on the conjecture, including its relationship with graph decompositions. Then we prove, as main result, that the conjecture is true whenever all the elements of L are in {1,2,3,5}.
Full work available at URL: https://arxiv.org/abs/1305.6482
Recommendations
- New methods to attack the Buratti-Horak-Rosa conjecture
- A note on the Buratti-Horak-Rosa conjecture about Hamiltonian paths in complete graphs
- On Hamiltonian paths with prescribed edge lengths in the complete graph
- Hamiltonian paths in the complete graph with edge-lengths 1, 2, 3
- Growable realizations: a powerful approach to the Buratti-Horak-Rosa conjecture
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On perfect Γ-decompositions of the complete graph
- On a problem of Marco Buratti
- Hamiltonian paths in the complete graph with edge-lengths 1, 2, 3
- On Hamiltonian paths with prescribed edge lengths in the complete graph
- Spanning trees with specified differences in Cayley graphs
- Dihedral Hamiltonian cycle systems of the cocktail party graph
- Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs
Cited In (12)
- On the Buratti-Horak-Rosa conjecture about Hamiltonian paths in complete graphs
- On Hamiltonian paths with prescribed edge lengths in the complete graph
- On unitary/strong linear realizations: Buratti-Horak-Rosa conjecture
- Hamiltonian paths in the complete graph with edge-lengths 1, 2, 3
- New methods to attack the Buratti-Horak-Rosa conjecture
- A problem on partial sums in abelian groups
- On a problem of Mariusz Meszka
- A generalization of the problem of Mariusz Meszka
- Growable realizations: a powerful approach to the Buratti-Horak-Rosa Conjecture
- Paths through equally spaced points on a circle
- Absolute differences along Hamiltonian paths
- A new proof for existence of horseshoe in the Rössler system
This page was built for publication: A new result on the problem of Buratti, Horak and Rosa
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394341)
