Pages that link to "Item:Q4967960"
From MaRDI portal
The following pages link to Packing trees of unbounded degrees in random graphs (Q4967960):
Displaying 16 items.
- Packing tree factors in random and pseudo-random graphs (Q405193) (← 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)
- A Short proof of the blow-up lemma for approximate decompositions (Q2678455) (← links)
- An Approximate Version of the Tree Packing Conjecture via Random Embeddings (Q2969640) (← links)
- Arboricity and spanning‐tree packing in random graphs (Q4642744) (← links)
- Tree decompositions of graphs without large bipartite holes (Q5120745) (← links)
- Almost all trees are almost graceful (Q5128748) (← links)
- Asymptotically optimal tree-packings in regular graphs (Q5950387) (← links)
- Perfectly packing graphs with bounded degeneracy and many leaves (Q6165180) (← links)
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 (Q6170531) (← links)
- Graph and hypergraph packing (Q6198635) (← links)
- A note on non-isomorphic edge-color classes in random graphs (Q6650720) (← links)