2000 character limit reached
Optimal decomposition of $K_{18}$ and $K_{19}$ into $K_3$ and $K_4$
Published 9 Jul 2025 in math.CO | (2507.06745v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.