Pages that link to "Item:Q2279501"
From MaRDI portal
The following pages link to Optimal packings of bounded degree trees (Q2279501):
Displaying 29 items.
- An approximate version of the tree packing conjecture (Q273108) (← links)
- Exact packing measure on a Galton-Watson tree (Q1613578) (← links)
- Packing degenerate graphs greedily (Q1689877) (← links)
- Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642) (← links)
- Resolution of the Oberwolfach problem (Q2039583) (← links)
- Embedding rainbow trees with applications to graph labelling and decomposition (Q2216732) (← links)
- Packing a number of copies of a \(( p , q )\)-graph (Q2217483) (← links)
- A proof of Ringel's conjecture (Q2232153) (← links)
- Packing degenerate graphs (Q2324574) (← 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)
- Packing trees of unbounded degrees in random graphs (Q4967960) (← links)
- Pseudorandom hypergraph matchings (Q4993112) (← links)
- Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree (Q5039053) (← links)
- Minimalist designs (Q5120741) (← links)
- Tree decompositions of graphs without large bipartite holes (Q5120745) (← links)
- Almost all trees are almost graceful (Q5128748) (← links)
- A rainbow blow‐up lemma (Q5128752) (← links)
- A rainbow blow-up lemma for almost optimally bounded edge-colourings (Q5135407) (← links)
- (Q5147550) (← links)
- Maximum tree-packing in time O(n5/2) (Q6085700) (← 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)
- Counting oriented trees in digraphs with large minimum semidegree (Q6564611) (← links)
- Seven largest trees pack (Q6597983) (← links)
- A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems (Q6603918) (← links)
- A rainbow blow-up lemma for almost optimally bounded edge-colourings (Q6621195) (← links)
- Resolution of the Oberwolfach problem (Q6621209) (← links)
