Yifan Zhang

collaborators

3 papers

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.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 $K_{v}$ by cliques of orders $3$ , $4$ , and $5$ . The first level minimizes the excess, namely the number of repeated edge oc…

math.CO2025

Minimum-Excess ${K_{3}, K_{4}}$ -Coverings of $K_{17}$ , $K_{18}$ , and $K_{19}$

Petr Kovář, Yifan Zhang

We determine the minimum-excess coverings of $K_{17}$ , $K_{18}$ , and $K_{19}$ by 3-cliques and 4-cliques, minimizing first the number of repeated edge occurrences and then the numb…

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

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

Minimum-Excess {K3​,K4​}-Coverings of K17​, K18​, and K19​

Minimum-Excess ${K_{3}, K_{4}}$ -Coverings of $K_{17}$ , $K_{18}$ , and $K_{19}$