Wild number for spanning trees in complete and complete bipartite graphs
Aleyah Dawkins, Alexander Nappo, Jessie Tong, Christopher Zimbizi
arXiv:2610.22142 [math.CO]. October 2026.
[arxiv ↗][pdf ↗][doi ↗][bibtex]
Abstract
Given an edge-colored graph, the wild number measures how close the graph is to having a spanning tree in every color. We investigate this parameter for complete graphs and complete bipartite graphs, with particular emphasis on minimum proper colorings and equitable 2-colorings.
