http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Packing trees into complete k-partite graph
Yanling Peng,Hong Wang 대한수학회 2022 대한수학회보 Vol.59 No.2
In this work, we confirm a weak version of a conjecture proposed by Hong Wang. The ideal of the work comes from the tree packing conjecture made by Gy\'arf\'as and Lehel. Bollob\'as confirms the tree packing conjecture for many small tree, who showed that one can pack $T_1,T_2,\ldots,T_{n/\sqrt{2}}$ into $K_n$ and that a better bound would follow from a famous conjecture of Erd\H{o}s. In a similar direction, Hobbs, Bourgeois and Kasiraj made the following conjecture: Any sequence of trees $T_1,T_2,\ldots,T_n$, with $T_i$ having order $i$, can be packed into $K_{n-1,\lceil n/2\rceil}$. Further Hobbs, Bourgeois and Kasiraj \cite{3} proved that any two trees can be packed into a complete bipartite graph $K_{n-1,\lceil n/2\rceil}$. Motivated by the result, Hong Wang propose the conjecture: For each $k$-partite tree $T(\mathbb{X})$ of order $n$, there is a restrained packing of two copies of $T(\mathbb{X})$ into a complete $k$-partite graph $B_{n+m}(\mathbb{Y})$, where $m=\lfloor\frac{k}{2}\rfloor$. Hong Wong \cite{4} confirmed this conjecture for $k=2$. In this paper, we prove a weak version of this conjecture.