Y. Chee

activity

20242026

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

Chouinard's Conjecture for Graphical t-Designs

Yeow Meng Chee

A $t$ -wise balanced design on the edge set of a complete graph is graphical if its block multiset is invariant under the induced action of the symmetric group on the vertices. Chou…

math.CO2026

On $t$ -edge-balanced graphs

Yeow Meng Chee

A graph $G$ on $n$ vertices with $k$ edges is $t$ -edge-balanced if every graph on $n$ vertices with $t$ edges is contained in exactly the same number of subgraphs of $K_{n}$ isomorph…

math.CO2025

Constructions of Covering Sequences and Arrays

Yeow Meng Chee, Tuvi Etzion, Hoang Ta +1

An $(n, R)$ -covering sequence is a cyclic sequence whose consecutive $n$ -tuples form a code of length $n$ and covering radius $R$ . Using several construction methods improvements of…

math.CO2024

Pairs in Nested Steiner Quadruple Systems

Yeow Meng Chee, Son Hoang Dau, Tuvi Etzion +2

Motivated by a repair problem for fractional repetition codes in distributed storage, each block of any Steiner quadruple system (SQS) of order $v$ is partitioned into two pairs. E…

Chouinard's Conjecture for Graphical t-Designs

On t-edge-balanced graphs

Constructions of Covering Sequences and Arrays

Pairs in Nested Steiner Quadruple Systems

On $t$ -edge-balanced graphs