Decomposing almost complete graphs by random trees
Anna Lladó · RECERCAT (Consorci de Serveis Universitaris de Catalunya) · 2014
An old conjecture of Ringel states that every tree with m edges decom- poses the complete graph K 2 m +1 . A more general version of the Ringel’s conjecture says that every tree with m edges decomposes K rm +1 for each r = 2 provided that r and m + 1 are not both odd. The best lower bound for the order of a complete graph decomposed by a given tree with m edge is O ( m 3 ). We show that asymptotically almost surely a random tree with m edges and p = 2 m + 1 is a prime decomposes the complete graph minus one edge K 3 p - e . We also show that, for every prime of the form 2 km + 1 a random tree with m edges asymptotically almost surely decomposes the graph K 2 km +1 (3) obtained from the complete graph by replacing each vertex by the complement of a triangle.