Ajani De Vas Gunasekara

activity

20202026

most citedPoetry of Repetition: Constructing Verse through Combinatorial Design Theory

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

collaborators

6 papers

math.CO2026

Chain--collider--fork Decompositions of Transitive Tournament

Ajani De Vas Gunasekara

A transitive tournament is an acyclic orientation of a complete graph. We study decompositions and packings of the transitive tournament $TT_n$ into connected two-arc motifs. The…

math.HO2025★ 1 cited

Poetry of Repetition: Constructing Verse through Combinatorial Design Theory

Ajani De Vas Gunasekara, Miriam Wei Wei Lo

This paper investigates the connections between combinatorial design theory and the creation of new forms of poetry through a specific combinatorial structure called Steiner triple…

math.CO2024

Completing partial $k$ -star designs

Ajani De Vas Gunasekara, Daniel Horsley

A $k$ -star is a complete bipartite graph $K_{1, k}$ . A partial $k$ -star design of order $n$ is a pair $(V, A)$ where $V$ is a set of $n$ vertices and $A$ is a set…

math.CO2023

Transitive path decompositions of Cartesian products of complete graphs

Ajani De Vas Gunasekara, Alice Devillers

An $H$ -decomposition of a graph $Γ$ is a partition of its edge set into subgraphs isomorphic to $H$ . A transitive decomposition is a special kind of $H$ -decomposition that is highl…

math.CO2021

Smaller embeddings of partial $k$ -star decompositions

Ajani De Vas Gunasekara, Daniel Horsley

A $k$ -star is a complete bipartite graph $K_{1, k}$ . For a graph $G$ , a $k$ -star decomposition of $G$ is a set of $k$ -stars in $G$ whose edge sets partition the edge set of $G$ . If…

math.CO2020

An Evans-style result for block designs

Ajani De Vas Gunasekara, Daniel Horsley

For positive integers $n$ and $k$ with $n \geq k$ , an $(n, k, 1)$ -design is a pair $(V, B)$ where $V$ is a set of $n$ points and $B$ is a collection of $k$ -subset…

Chain--collider--fork Decompositions of Transitive Tournament

Poetry of Repetition: Constructing Verse through Combinatorial Design Theory

Completing partial k-star designs

Transitive path decompositions of Cartesian products of complete graphs

Smaller embeddings of partial k-star decompositions

An Evans-style result for block designs

Completing partial $k$ -star designs

Smaller embeddings of partial $k$ -star decompositions