Searcharxiv⌕ Search

arXiv subjects

Marco Antonio Pellegrini

Publications and source records attributed to Marco Antonio Pellegrini.

27 records · Page 2Linked to original sources

The (2,3)-generation of the special linear groups over finite fields

We complete the classification of the finite special linear groups $\SL_n(q)$ which are $(2,3)$-generated, i.e., which are generated by an involution and an element of order $3$. This also gives the classification of the finite simple groups $\PSL_n(q)$ which are $(2,3)$-generated.

math.GR↗

Cyclic uniform 2-factorizations of the complete multipartite graph

The generalization of the Oberwolfach Problem, proposed by J. Liu in 2000, asks for a uniform $2$-factorization of the complete multipartite graph $K_{m\times n}$. Here we focus our attention on $2$-factorizations regular under the cyclic group $Z_{mn}$, whose $2$-factors are disjoint union of cycles all of even length $\ell$. In particular, we present a complete solution for the extremal cases $\ell=4$ and $\ell=mn$.

math.CO↗

Cyclic hamiltonian cycle systems of the complete multipartite graph: even number of parts

A hamiltonian cycle system (HCS, for short) of a graph $Γ$ is a partition of the edges of $Γ$ into hamiltonian cycles. A HCS is cyclic when it is invariant under a cyclic permutation of all the vertices of $Γ$; the existence problem for a cyclic HCS has been completely solved by Buratti and Del Fra in 2004 when $Γ$ is the complete graph $K_v$, $v$ odd, and by Jordon and Morris in 2008 when $Γ$ is the complete graph minus a $1$-factor $K_v-I$, $v$ even. In this work we present a complete solution to the existence problem of a cyclic HCS for $Γ= K_{m\times n}$, the complete multipartite graph, when the number of parts $m$ is even. We also give necessary and sufficient conditions for the existence of a cyclic and symmetric HCS of $Γ$; the notion of a symmetric HCS of a graph $Γ$ has been introduced in 2004 by Akiyama, Kobayashi, and Nakamura for $Γ=K_v$, $v$ odd, in 2011 by Brualdi and Schroeder when $Γ= K_v-I$, $v$ even, and, very recently, by Schroeder when $Γ$ is the complete multipartite graph.

math.CO↗

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.

math.CO↗

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>=4, provided that a+b>=t-1. 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.

math.CO↗

A new result on the problem of Buratti, Horak and Rosa

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}.

math.CO↗

Coprime commutators in PSL(2,q)

We show that every element of PSL(2,q) is a commutator of elements of coprime orders. This is proved by showing first that in PSL(2,q) any two involutions are conjugate by an element of odd order.

math.GR↗