A note on heterogeneous decompositions into spanning trees
Adrian Riskin
Abstract
In answer to a question of Eggleton, we prove that the complete multigraph on 5 vertices with edge multiplicity 6, namely K5(6), has a decomposition into 5 copies of the family of trees of order 5 and that K7(22) has a decomposition into 7 copies of the family of trees of order 7. We prove something similar for K2n+1 for n 13.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.