K. Markström

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2025

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…

math.CO2025

Density conditions for $k$ vertex-disjoint triangles in tripartite graphs

Mingyang Guo, Klas MarkstrÃ¶m

Let $n, k$ be positive integers such that $n \geq k$ and $G$ be a tripartite graph with parts $A, B, C$ such that $∣ A ∣ = ∣ B ∣ = ∣ C ∣ = n$ . Denote the edge densities of $G [A, B]$ , $G [A, C]$ and $…

math.CO2024

Enumeration of Row-Column Designs

Gerold JÃ¤ger, Klas MarkstrÃ¶m, Lars-Daniel Ãhman +1

We computationally completely enumerate a number of types of row-column designs up to isotopism, including double, sesqui and triple arrays as known from the literature, and two ne…

math.CO2024

Rainbow variations on a theme by Mantel: extremal problems for Gallai colouring templates

Victor Falgas-Ravry, Klas MarkstrÃ¶m, Eero RÃ¤ty

Let $G := (G_{1}, G_{2}, G_{3})$ be a triple of graphs on the same vertex set $V$ of size $n$ . A rainbow triangle in $G$ is a triple of edges $(e_{1}, e_{2}, e_{3})$ with $e_i\…

Near Triple Arrays

Density conditions for k vertex-disjoint triangles in tripartite graphs

Enumeration of Row-Column Designs

Rainbow variations on a theme by Mantel: extremal problems for Gallai colouring templates

Density conditions for $k$ vertex-disjoint triangles in tripartite graphs