Wild-number conjecture for minimum proper colorings of complete graphs
Let denote the wild number of a properly edge-colored complete graph , and let range over proper edge-colorings using the minimum possible number of colors. The conjecture is that, for every , the general lower bound established for these wild numbers is sharp; equivalently, the minimum wild number among minimum proper colorings satisfies . The conjecture is known for , but remains open for general .
References
- Wild number for spanning trees in complete and complete bipartite graphs — arXiv — Aleyah Dawkins, Alexander Nappo, Jessie Tong, Christopher Zimbizi
Source: arXiv
Progress summary
A new paper proves a lower bound and checks the conjecture for complete graphs of sizes three through twelve, but the proposed formula for all sizes remains unproved.
The wild-number conjecture concerns the minimum number of colors needed in properly edge-colored complete graphs to guarantee the relevant spanning-tree coverage. The latest report proposes an all-size formula but explicitly leaves that formula conjectural.
October 2026 development
Dawkins, Nappo, Tong, and Zimbizi establish a general lower bound, determine exact values for , and conjecture that the lower bound is sharp for every . This is substantive partial progress, not a resolution of the all- conjecture.
Current status (as of October 2026): The general lower bound and exact cases are reported, while sharpness for all remains open.
Sources
Solutions 0
No solutions have been posted yet.