Yifan Zhang

collaborators

3 papers

math.CO2026

Minimum-excess coverings of complete graphs by 3-, 4-, and 5-cliques

Petr KovÃ¡Å, Yifan Zhang

We study two-level optimal coverings of the complete graph Kv by cliques of orders 3, 4, and 5. The first level minimizes the excess, namely the number of repeated edge occurrences…

math.CO2026

A SAT-based Filtering Framework for Exact Coverings of K33 by Cliques of Order 3, 4 or 5

Petr KovaÅ, Yifan Zhang

We investigate the minimum number of cliques of orders $3$ , $4$ , and $5$ needed to cover the edges of $K_{33}$ with zero excess. General covering results yield the lower bound 57.…

math.CO2025

Optimal decomposition of $K_{18}$ and $K_{19}$ into $K_{3}$ and $K_{4}$

Petr KovÃ¡Å, Yifan Zhang

This article explores a new way to obtain the optimal decomposition of a complete graph of order 18 and 19 into cliques of order 3 and 4.

Minimum-excess coverings of complete graphs by 3-, 4-, and 5-cliques

A SAT-based Filtering Framework for Exact Coverings of K33 by Cliques of Order 3, 4 or 5

Optimal decomposition of K18​ and K19​ into K3​ and K4​

Optimal decomposition of $K_{18}$ and $K_{19}$ into $K_{3}$ and $K_{4}$