8 citations · 22 across the 11 of their papers we have counts for
12 papers
Abstract questionnaires and FS-decision digraphs
Jiaye Chen, Suzan Kadri, Mateja Šajna +1
A questionnaire is a sequence of multiple choice questions aiming to collect data on a population. We define an abstract questionnaire as an ordered pair , where …
On the spouse-loving variant of the Oberwolfach problem
Noah Bolohan, Iona Buchanan, Andrea Burgess +2
We prove that , the complete graph of an even order with a -factor duplicated, admits a decomposition into -factors, each a disjoint union of cycles of length $m \geq…
The directed Oberwolfach problem with variable cycle lengths: a recursive construction
Suzan Kadri, Mateja Šajna
The directed Oberwolfach problem OP asks whether the complete symmetric digraph , assuming , admits a decomposition into spannin…
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 with parts of size to admit a resolvable decomposition into…
Covering hypergraphs are eulerian
Mateja Šajna, Andrew Wagner
An Euler tour in a hypergraph (also called a rank-2 universal cycle or 1-overlap cycle in the context of designs) is a closed walk that traverses every edge exactly once. In this p…
Using edge cuts to find Euler tours and Euler families in hypergraphs
Mateja Šajna, Andrew Wagner
An Euler tour in a hypergraph is a closed walk that traverses each edge of the hypergraph exactly once, while an Euler family is a family of closed walks that jointly traverse each…