We consider packing tree degree sequences in this paper. We set up aconjecture that any arbitrary number of tree degree sequences without commonleaves have edge disjoint tree realizations. This conjecture is known to betrue for $2$ and $3$ tree degree sequences. In this paper, we give a proof for$4$ tree degree sequences and a computer aided proof for $5$ tree degreesequences. We also prove that for arbitrary $k$, $k$ tree degree sequenceswithout common leaves and at least $2k-4$ vertices which are not leaves in anyof the trees always have edge disjoint tree realizations. The main ingredientin all of the presented proofs is to find rainbow matchings in certainconfigurations.
展开▼
机译：我们考虑本文的包装树度序列。我们设置了Aconjecture，即没有Commonleaves的任何任意数量的树度序列具有边缘不相交的树实现。该猜想已知为2美元和3美元的树度序列令人兴奋。在本文中，我们为4美元的树度序列和计算机辅助证明提供了5美元的验证，以5美元$ 5 $树。我们还证明，对于任意$ k $，$ k $树度序列序列，常见的叶子和至少$ 2k-4 $顶点，这些顶点在树木的任何内容中都不会留下边缘不相交的树艺。主要的成分所有提出的证据都是在某些Configurations中找到彩虹匹配。
展开▼
