The following pages link to Packing trees in complete graphs (Q1101132):
Displaying 26 items.
- An approximate version of the tree packing conjecture (Q273108) (← links)
- On Erdős-Sós conjecture for trees of large size (Q276193) (← links)
- Packing three copies of a tree into a complete bipartite graph (Q659792) (← links)
- On cyclic packing of a tree (Q704857) (← links)
- Packing sequences (Q787987) (← links)
- A note on packing trees into complete bipartite graphs and on Fishburn's conjecture (Q914692) (← links)
- On self-complementary cyclic packing of forests (Q1010622) (← links)
- Mutual placement of bipartite graphs (Q1309454) (← links)
- On packing trees into complete bipartite graphs (Q1356567) (← links)
- A note on packing of three forests (Q1356715) (← links)
- Packing three trees (Q1916129) (← links)
- Packing a number of copies of a \(( p , q )\)-graph (Q2217483) (← links)
- Packing branchings under cardinality constraints on their root sets (Q2225417) (← links)
- Optimal packings of bounded degree trees (Q2279501) (← links)
- Packing large trees of consecutive orders (Q2374181) (← links)
- Packing spanning graphs from separable families (Q2628001) (← links)
- (Q3033795) (← links)
- Packingk-edge trees in graphs of restricted vertex degrees (Q3594953) (← links)
- (Q3699703) (← links)
- (Q4017048) (← links)
- A blow-up lemma for approximate decompositions (Q4633567) (← links)
- Packing trees of unbounded degrees in random graphs (Q4967960) (← links)
- Packing four copies of a tree into a complete bipartite graph (Q5071592) (← links)
- (Q5074393) (← links)
- My Top 10 Graph Theory Conjectures and Open Problems (Q5506779) (← links)
- Seven largest trees pack (Q6597983) (← links)
