Ringel's conjecture
Summary
- Ringel's conjecture that the complete graph can be decomposed into copies of any tree with edges (Richard Montgomery, Benny Sudakov, Alexey Pokrovskiy, 2020).
Further reading
- Wikipedia, page 183091, revision 1376385932, List of unsolved problems in mathematics, section Problems solved since 2015 > Graph theory. adopted
About this page
| Tag | 3QRX023Q4E |
|---|---|
| URI | m2://3QRX023Q4E |
| 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.