5 research outputs found
A problem on partial sums in abelian groups
In this paper we propose a conjecture concerning partial sums of an arbitrary
finite subset of an abelian group, that naturally arises investigating simple
Heffter systems. Then, we show its connection with related open problems and we
present some results about the validity of these conjectures
A generalization of the problem of Mariusz Meszka
Mariusz Meszka has conjectured that given a prime p=2n+1 and a list L
containing n positive integers not exceeding n there exists a near 1-factor in
K_p whose list of edge-lengths is L. In this paper we propose a generalization
of this problem to the case in which p is an odd integer not necessarily prime.
In particular, we give a necessary condition for the existence of such a near
1-factor for any odd integer p. We show that this condition is also sufficient
for any list L whose underlying set S has size 1, 2, or n. Then we prove that
the conjecture is true if S={1,2,t} for any positive integer t not coprime with
the order p of the complete graph. Also, we give partial results when t and p
are coprime. Finally, we present a complete solution for t<12.Comment: 15 page
On the Buratti-Horak-Rosa Conjecture about Hamiltonian Paths in Complete Graphs
In this paper we investigate a problem proposed by Marco Buratti, Peter Horak and Alex Rosa (denoted by BHR-problem) concerning Hamiltonian paths in the complete graph with prescribed edge-lengths. In particular we solve BHR({1^a,2^b,t^c}) for any even integer t 654, provided that a+b 65t 121. Furthermore, for t=4,6,8 we present a complete solution of BHR({1^a,2^b,t^c}) for any positive integer a,b,c