---
tag: 6AHDEVZD0Q
kind: concept
name: Walescki's theorem for hypergraphs
sources:
  - wikipedia: en:183091@r1376385932
    locator: List of unsolved problems in mathematics, section Unsolved problems > Graph theory > Subgraphs
    note: adopted
    mention: wikipedia://en/183091#I1NF
    sections: [Summary]
inventory: [PH9J1KR81E]
---

## Summary

- Walescki's theorem for hypergraphs: Do complete $k$-uniform hypergraphs admit Hamiltonian decompositions into tight cycles?