The following pages link to On the Tree Packing Conjecture (Q5408605):
Displaying 20 items.
- An approximate version of the tree packing conjecture (Q273108) (← links)
- On Erdős-Sós conjecture for trees of large size (Q276193) (← links)
- On cyclic packing of a tree (Q704857) (← links)
- On self-complementary cyclic packing of forests (Q1010622) (← links)
- Two packing problems on \(k\)-matroid trees (Q1178033) (← links)
- A note on packing of three forests (Q1356715) (← links)
- Exact packing measure on a Galton-Watson tree (Q1613578) (← links)
- Packing a number of copies of a \(( p , q )\)-graph (Q2217483) (← links)
- Optimal packings of bounded degree trees (Q2279501) (← links)
- Packing degenerate graphs (Q2324574) (← links)
- Packing large trees of consecutive orders (Q2374181) (← links)
- Packing spanning graphs from separable families (Q2628001) (← links)
- (Q3033795) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- (Q4017048) (← links)
- A blow-up lemma for approximate decompositions (Q4633567) (← links)
- Packing trees of unbounded degrees in random graphs (Q4967960) (← links)
- Maximum tree-packing in time O(n5/2) (Q6085700) (← links)
- Placing two edge-disjoint copies of a tree into a bipartite graph (Q6105991) (← links)
- Seven largest trees pack (Q6597983) (← links)
