In this paper, we pose an algorithm to find a packing of two graphs Gl and G2, where G1 is composed of a tree with k edges and an independent set and G2 contains no cycles of length 4 and ｜E(G2)｜ <1/2nk. The pack...In this paper, we pose an algorithm to find a packing of two graphs Gl and G2, where G1 is composed of a tree with k edges and an independent set and G2 contains no cycles of length 4 and ｜E(G2)｜ <1/2nk. The packing problem is a restatement of the Erdos and Sos Conjecture with the complement of G contains no cycles of length 4.展开更多
文摘In this paper, we pose an algorithm to find a packing of two graphs Gl and G2, where G1 is composed of a tree with k edges and an independent set and G2 contains no cycles of length 4 and ｜E(G2)｜ <1/2nk. The packing problem is a restatement of the Erdos and Sos Conjecture with the complement of G contains no cycles of length 4.
