Showing math.COShow all
2 papers · 1 filter
math.CO2026
Wild number for spanning trees in complete and complete bipartite graphs
Aleyah Dawkins, Alexander Nappo, Jessie Tong +1
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 complet…
math.CO2025
EKR-Type Theorems for Pendant Graph Constructions
Michael Carrion, Melissa M. Fuentes, Zaphenath Joseph +1
The classical Erdős--Ko--Rado (EKR) theorem characterizes the maximum size of intersecting families of -element subsets of an -element set. We study EKR-type questions for in…