Pages that link to "Item:Q273108"
From MaRDI portal
The following pages link to An approximate version of the tree packing conjecture (Q273108):
Displaying 20 items.
- Packing minor-closed families of graphs into complete graphs (Q273186) (← links)
- Packing degenerate graphs greedily (Q1689877) (← links)
- Embedding rainbow trees with applications to graph labelling and decomposition (Q2216732) (← links)
- A proof of Ringel's conjecture (Q2232153) (← 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)
- A Short proof of the blow-up lemma for approximate decompositions (Q2678455) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- A blow-up lemma for approximate decompositions (Q4633567) (← links)
- Packing trees of unbounded degrees in random graphs (Q4967960) (← links)
- Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree (Q5039053) (← links)
- Tree decompositions of graphs without large bipartite holes (Q5120745) (← links)
- Almost all trees are almost graceful (Q5128748) (← links)
- Decomposing almost complete graphs by random trees (Q5915750) (← links)
- Problems close to my heart (Q6116410) (← links)
- Perfectly packing graphs with bounded degeneracy and many leaves (Q6165180) (← links)
- Graph and hypergraph packing (Q6198635) (← links)
- Seven largest trees pack (Q6597983) (← links)
