84 citations · 438 across the 47 of their papers we have counts for
29 papers · 1 filter
Near Triple Arrays
Alexey Gordeev, Klas Markström, Lars-Daniel Öhman
We introduce near triple arrays as binary row-column designs with at most two consecutive values for the replication numbers of symbols, for the intersection sizes of pairs of rows…
Minimum degree conditions for rainbow triangles
Victor Falgas-Ravry, Klas Markström, Eero Räty
Let be a triple of graphs on a common vertex set of size . A rainbow triangle in is a triple of edges with $e_i\…
The Largest Condorcet Domains on 8 Alternatives
Charles Leedham-Green, Klas Markström, Søren Riis
In this note, we report on a record-breaking Condorcet domain (CD) for n=8 alternatives. We show that there exists a CD of size 224, which is optimal and essentially unique (up to…
Rainbow variations on a theme by Mantel: extremal problems for Gallai colouring templates
Victor Falgas-Ravry, Klas Markström, Eero Räty
Let be a triple of graphs on the same vertex set of size . A rainbow triangle in is a triple of edges with $e_i\…
Enumeration of Sets of Mutually Orthogonal Latin Rectangles
Gerold Jäger, Klas Markström, Denys Shcherbak +1
We study sets of mutually orthogonal Latin rectangles (MOLR), and a natural variation of the concept of self-orthogonal Latin squares which is applicable on larger sets of mutually…
Small Youden Rectangles, Near Youden Rectangles, and Their Connections to Other Row-Column Designs
Gerold Jäger, Klas Markström, Denys Shcherbak +1
In this paper we first study Youden rectangles of small orders. We have enumerated all Youden rectangles for a range of small parameter values, excluding the almost sq…