T. Traetta

activity

20182026

most citedA sharp upper bound for the harmonious total chromatic number of graphs and multigraphs

1 citations · 2 across the 11 of their papers we have counts for

collaborators

Showing 2023Show all

4 papers · 1 filter

math.CO2023

A survey on constructive methods for the Oberwolfach problem and its variants

Andrea Burgess, Peter Danziger, Tommaso Traetta

The generalized Oberwolfach problem asks for a decomposition of a graph $G$ into specified 2-regular spanning subgraphs $F_{1}, \dots, F_{k}$ , called factors. The classic Oberwolfach p…

math.CO2023

On the minisymposium problem

Peter Danziger, Eric Mendelsohn, Brett Stevens +1

The generalized Oberwolfach problem asks for a factorization of the complete graph $K_{v}$ into prescribed $2$ -factors and at most a $1$ -factor. When all $2$ -factors are pairwise iso…

math.CO2023

A constructive solution to the Oberwolfach Problem with a large cycle

Tommaso Traetta

For every $2$ -regular graph $F$ of order $v$ , the Oberwolfach problem $O P (F)$ asks whether there is a $2$ -factorization of $K_{v}$ ( $v$ odd) or $K_{v}$ minus a $1$ -factor ( $v$ even) in…

math.CO2023

Constructing generalized Heffter arrays via near alternating sign matrices

Lorenzo Mella, Tommaso Traetta

Let $S$ be a subset of a group $G$ (not necessarily abelian) such that $S \cap - S$ is empty or contains only elements of order $2$ , and let $\mathbf{h}=(h_1,\ldots, h_m)\in \mathb…