Walescki's theorem for hypergraphs
Summary
- Walescki's theorem for hypergraphs: Do complete -uniform hypergraphs admit Hamiltonian decompositions into tight cycles?
Further reading
- Wikipedia, page 183091, revision 1376385932, List of unsolved problems in mathematics, section Unsolved problems > Graph theory > Subgraphs. adopted
About this page
| Tag | 6AHDEVZD0Q |
|---|---|
| URI | m2://6AHDEVZD0Q |
| Kind | concept |
| Writing | W1 stated |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.