ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k≥1k\geq 1 and let Tn,Tn−1,…,Tn−k+1T_n,T_{n-1},\dots,T_{n-k+1} be trees, where Tn−jT_{n-j} has n−jn-j vertices. The trees pack into KnK_n when they can be found as pairwise edge-disjoint subgraphs of the complete graph KnK_n. Bollobás's conjecture. For every k≥1k\geq 1 there is an n0(k)n_0(k) such that if n>n0(k)n>n_0(k), then any set of kk trees Tn,Tn−1,…,Tn−k+1T_n,T_{n-1},\dots,T_{n-k+1} such that Tn−jT_{n-j} has n−jn-j vertices pack into KnK_n. This weakens Gyárfás's Tree Packing Conjecture, which asks for packing trees of every order from 11 through nn; the paper confirms the conjecture for certain trees and, as a consequence, for k≤5k\leq 5.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.