Pages that link to "Item:Q2039583"
From MaRDI portal
The following pages link to Resolution of the Oberwolfach problem (Q2039583):
Displaying 19 items.
- Gersten resolution with support (Q1014800) (← links)
- On zero-sum spanning trees and zero-sum connectivity (Q2073300) (← links)
- Decomposing hypergraphs into cycle factors (Q2101168) (← links)
- On the Oberwolfach problem for single-flip 2-factors via graceful labelings (Q2120828) (← 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)
- Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree (Q5039053) (← links)
- A rainbow blow-up lemma for almost optimally bounded edge-colourings (Q5135407) (← links)
- On the generalized Oberwolfach problem (Q5217059) (← links)
- On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles (Q6086218) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- A complete solution to the infinite Oberwolfach problem (Q6187427) (← links)
- Graph and hypergraph packing (Q6198635) (← links)
- A constructive solution to the Oberwolfach problem with a large cycle (Q6204356) (← links)
- Solutions to the Oberwolfach problem for orders up to 100 (Q6562432) (← links)
- Regular decomposition of the edge set of a graph with applications (Q6562433) (← links)
- The Oberwolfach problem with loving couples (Q6584899) (← links)
- Transference for loose Hamilton cycles in random 3-uniform hypergraphs (Q6596385) (← links)
- A survey on constructive methods for the Oberwolfach problem and its variants (Q6613359) (← links)
