The wild number of an edge-colored graph
Abstract
We introduce the wild number of an edge-colored graph as a measure of how close an edge-colored graph is to having a spanning tree in every color. This combinatorial concept originates in the algebraic theory of generalized graph splines. After showing that determining the wild number of a graph is an NP-complete problem, we provide bounds on the wild number and find the exact wild number for trees, cycles, and families of graphs with restrictions on the edge-colorings. This article serves as an invitation to the topic of wild numbers and includes several open problems, many of which are suitable for undergraduate research projects.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.