Bollobás's consecutive-order tree packing conjecture
Statement
Let and let be trees, where has vertices. The trees pack into when they can be found as pairwise edge-disjoint subgraphs of the complete graph . Bollobás's conjecture. For every there is an such that if , then any set of trees such that has vertices pack into . This weakens Gyárfás's Tree Packing Conjecture, which asks for packing trees of every order from through ; the paper confirms the conjecture for certain trees and, as a consequence, for .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.