Shikang Yu

collaborators

4 papers

math.CO2026

On the completion of $I^µ$ -dense partial Latin squares

Shikang Yu, Tao Feng

A partial Latin square of order $n$ is called $I^µ$ -dense if each row and each column contains at most $I^µ n$ filled cells, and each symbol occurs at most $I^µ n$ times. A partial Lati…

math.CO2026

Fractional clique decompositions of dense balanced multipartite graphs

Tao Feng, Hengrui Liu, Shikang Yu

This paper concerns fractional $K_{s}$ -decompositions of multipartite graphs. For integers $r \geq s \geq 3$ , we consider balanced $r$ -partite graphs $G$ on $r n$ vertices. We establish n…

math.CO2026

Paley-type matrices and $1$ -factorizations of complete graphs

Chi Hoi Yip, Semin Yoo, Shikang Yu

Ball, Ortega--Moreno, and Prodromou asked two questions about whether, for every odd prime $p$ , one can find a $1$ -factor of the complete graph $K_{p + 1}$ with some arithmetic restr…

math.CO2024

Existence of magic rectangle sets over finite abelian groups

Shikang Yu, Tao Feng, Hengrui Liu

Let $a$ , $b$ and $c$ be positive integers. Let $(G, +)$ be a finite abelian group of order $ab c$ . A $G$ -magic rectangle set MRS $_{G} (a, b; c)$ is a collection of $c$ arrays of size $a\t…

On the completion of I^µ-dense partial Latin squares

Fractional clique decompositions of dense balanced multipartite graphs

Paley-type matrices and 1-factorizations of complete graphs

Existence of magic rectangle sets over finite abelian groups

On the completion of $I^µ$ -dense partial Latin squares

Paley-type matrices and $1$ -factorizations of complete graphs