Template:Did you know nominations/Steinitz's theorem

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 Capsulecap (talk) 18:50, 21 August 2021 (UTC)

Steinitz's theorem

(

• Back to T:TDYK
• Article history

)

• ... that, according to a strengthening of Steinitz's theorem, every convex polyhedron has an equivalent form with integer coordinates? Source: Grünbuam, Convex Polytopes, 2003, Theorem 13.2.3, p. 244 (stated there in an equivalent form using rational numbers in place of integers)
  • ALT1:... that although Steinitz's theorem is commonly used to describe convex polyhedra using graph theory, its original formulation did not use graphs? Source: Grünbaum, "Graphs of polyhedra; polyhedra as graphs", http://hdl.handle.net/1773/2276

• Reviewed: Bronwyn Law-Viljoen

Improved to Good Article status by David Eppstein (talk). Self-nominated at 19:34, 14 August 2021 (UTC).

General: Article is new enough and long enough
New enough: Long enough:

Policy: Article is sourced, neutral, and free of copyright problems
Adequate sourcing: Neutral: Free of copyright violations, plagiarism, and close paraphrasing:

Hook: Hook has been verified by provided inline citation
Cited: - Offline/paywalled citation accepted in good faith Interesting:

QPQ: Done.

Overall: Good to go with main or ALT1 Hawkeye7 (discuss) 20:50, 14 August 2021 (UTC)

To T:DYK/P6