Pages that link to "Item:Q4967769"
From MaRDI portal
The following pages link to A bandwidth theorem for approximate decompositions (Q4967769):
Displaying 12 items.
- Resolution of the Oberwolfach problem (Q2039583) (← links)
- Decomposing hypergraphs into cycle factors (Q2101168) (← links)
- Progress towards Nash-Williams' conjecture on triangle decompositions (Q2221932) (← links)
- Optimal packings of bounded degree trees (Q2279501) (← links)
- On the relation of separability, bandwidth and embedding (Q2287746) (← links)
- A greedy algorithm for the social golfer and the Oberwolfach problem (Q2670589) (← links)
- A Short proof of the blow-up lemma for approximate decompositions (Q2678455) (← links)
- Pseudorandom hypergraph matchings (Q4993112) (← links)
- Tree decompositions of graphs without large bipartite holes (Q5120745) (← links)
- The bandwidth theorem for locally dense graphs (Q5135412) (← links)
- On sufficient conditions for spanning structures in dense graphs (Q6075109) (← links)
- Graph and hypergraph packing (Q6198635) (← links)
