Template:Did you know nominations/Keller's conjecture
- The following is an archived discussion of the DYK nomination of the article below. Please do not modify this page. Subsequent comments should be made on the appropriate discussion page (such as this nomination's talk page, the article's talk page or Wikipedia talk:Did you know), unless there is consensus to re-open the discussion at this page. No further edits should be made to this page.
The result was: promoted by SL93 (talk) 07:50, 20 April 2021 (UTC)
| DYK toolbox |
|---|
Keller's conjecture
- ... that a mathematical conjecture about tiling space by cubes was transformed into a problem in graph theory that became a benchmark for clique-finding algorithms? Source: Debroni et al.: "Keller graphs are in the benchmark set of clique problems from the DIMACS clique challenge"
- Reviewed: Marion Miley
Improved to Good Article status by David Eppstein (talk). Self-nominated at 20:14, 1 April 2021 (UTC).
(checked Debroni source for hook); article is long enough and new enough; hook is about as suitable for a popular audience as is possible here. Chiswick Chap (talk) 14:20, 7 April 2021 (UTC)
