Optimal partial clique edge covering guided by potential energy minimization

For given integers\ua0k,\ua0n,\ua0r\ua0we aim at families of\ua0k\ua0sub-cliques called blocks, of a clique with\ua0n\ua0vertices, such that every block has\ua0r\ua0vertices, and the blocks together cover a maximum number of edges. We demonstrate a combinatorial optimization method that generates such optimal partial clique edge coverings. It takes certain packages of columns (corresponding to vertices) in the incidence matrix of the blocks, considers the number of uncovered edges as an energy term that has to be minimized by transforming these packages. As a proof of concept we can completely solve the above maximization problem in the case of\ua0k≤4k≤4\ua0blocks and obtain optimal coverings for all integers\ua0n\ua0and\ua0r\ua0with\ua0r/n≥5/9r/n≥5/9. This generalizes known results for total coverings to partial coverings. The method as such is not restricted to\ua0k≤4k≤4\ua0blocks, but a challenge for further research (also on total coverings) is to limit the case distinctions when more blocks are involved