2024/10/17 by Chalise, Parikshit, Clark, Antwan, Gnang, Edinah K.
#05B30 #05C70 #Combinatorics (math.CO) #FOS: Mathematics #G.2.2
paper · doi:10.48550/arxiv.2410.13840
We prove a conjecture of Gyárfás (1976), which asserts that any family of trees T1, …, Tn where each Tk has k vertices packs into Kn. We do so by translating the decomposition problem into a labeling problem, namely complete labeling. Our proof employs the polynomial method using a functional reformulation of the conjecture.