Mateja vSajna

activity

20202024

most citedOn the Directed Oberwolfach Problem with variable cycle lengths

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

collaborators

3 papers

math.CO2024

The Honeymoon Oberwolfach Problem: small cases

Marie Rose Jerade, Mateja Šajna

The Honeymoon Oberwolfach Problem HOP $(2 m_{1}, 2 m_{2}, \dots, 2 m_{t})$ asks the following question. Given $n = m_{1} + m_{2} + \dots + m_{t}$ newlywed couples at a conference and $t$ round tables of s…

math.CO2021

$ℓ$ -covering $k$ -hypergraphs are quasi-eulerian

Mateja Šajna, Andrew Wagner

An Euler tour in a hypergraph $H$ is a closed walk that traverses each edge of $H$ exactly once, and an Euler family is a family of closed walks that jointly traverse each edge of…

math.CO2020★ 1 cited

On the Directed Oberwolfach Problem with variable cycle lengths

Elaheh Shabani, Mateja Šajna

The Directed Oberwolfach Problem can be considered as the directed version of the well-known Oberwolfach Problem, first mentioned by Ringel at a conference in Oberwolfach, Germany…

The Honeymoon Oberwolfach Problem: small cases

ℓ-covering k-hypergraphs are quasi-eulerian

On the Directed Oberwolfach Problem with variable cycle lengths

$ℓ$ -covering $k$ -hypergraphs are quasi-eulerian