arXiv (All)
open access
Minimum-excess coverings of complete graphs by 3-, 4-, and 5-cliques
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 occurrences, and the second level minimizes the number of cliques among coverings with minimum excess. We first isolate th
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Remaining $K_4$-Free Case in the Multipartite Clique Problem#1013778
- An improved lower and upper bound of the k-limited domination number#1156714
- Conflict-Free Coloring Planar Graphs with 4 Colors#615074
- Conflict-Free Coloring Planar Graphs with 4 Colors#614107
- On Hypergraph Supports#1013362
Record · ID 1142646
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive