The following pages link to Packing degenerate graphs (Q2324574):
Displayed 12 items.
- Resolution of the Oberwolfach problem (Q2039583) (← links)
- Embedding rainbow trees with applications to graph labelling and decomposition (Q2216732) (← links)
- A proof of Ringel's conjecture (Q2232153) (← links)
- The generalised Oberwolfach problem (Q2664557) (← links)
- A Short proof of the blow-up lemma for approximate decompositions (Q2678455) (← 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)
- A rainbow blow-up lemma for almost optimally bounded edge-colourings (Q5135407) (← 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)