加载中…
Two graphs and on vertices are said to if there exist injective mappings of their vertex sets into such that the images of their edge sets are disjoint. A longstanding conjecture due to Bollob'as and Eldridge and, independently, Catlin, asserts that, if $(\Delta(G_1)+1) (\Delta(G_2)+1) \le n+1G_1G_2$ pack. We consider the validity of this assertion under the additional assumptions that neither nor contain a -, - or -cycle, and that or is large enough ().

生成讲解博客的中文版本

生成AI智能校验的中文版本