Mateja Šajna

activity

20162023

most citedOn the directed Oberwolfach Problem with equal cycle lengths: the odd case

5 citations · 6 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2023

On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform-length cycles

Nevena Francetić, Mateja Šajna

We examine the necessary and sufficient conditions for a complete symmetric equipartite digraph $K_{n [m]}^{*}$ with $n$ parts of size $m$ to admit a resolvable decomposition into…

math.CO2017★ 5 cited

On the directed Oberwolfach Problem with equal cycle lengths: the odd case

Andrea Burgess, Nevena Francetic, Mateja Sajna

We show that the complete symmetric digraph $K_{2 m}^{*}$ admits a resolvable decomposition into directed cycles of length $m$ for all odd $m$ , $5 \leq m \leq 49$ . Consequently, $K_{…

math.CO2016★ 1 cited

Eulerian properties of hypergraphs

M. Amin Bahmanian, Mateja Šajna

In this paper we study three substructures in hypergraphs that generalize the notion of an Euler tour in a graph. A flag-traversing tour of a hypergraph corresponds to an Euler tou…