Talk:Steinitz's theorem

{{GA|06:21, 14 August 2021 (UTC)|topic=Mathematics and mathematicians|page=1|oldid=1038706902}}

{{DYK talk|25 August|2021|entry=... that although Steinitz's theorem is commonly used to describe convex polyhedra using graph theory, its original formulation did not use graphs?|nompage=Template:Did you know nominations/Steinitz's theorem}}

{{WikiProject banner shell|class=GA|

}}

Who

Who was Steinitz who made that theorem? Maybe you should add that? — Preceding unsigned comment added by 193.2.132.123 (talk • contribs)

:You stopped reading before the fourth sentence? —David Eppstein (talk) 17:51, 7 April 2013 (UTC)

Simple graphs

Should the statement of Steinitz Theorem specify a simple graph? See for example [https://link.springer.com/chapter/10.1007/978-1-4613-8431-1_4 Lectures on Polytopes by Gunter Ziegler]. Greenlinda (talk) 21:03, 25 August 2022 (UTC)

:If we're being pedantic, we need to specify that we are talking about finite simple undirected 3-vertex-connected planar graphs. This might be appropriate in the "definitions" section. In the lead, clarity is more important than pedantry. —David Eppstein (talk) 00:06, 26 August 2022 (UTC)

::I only asked because, as a novice to graph theory, I spent about 10 minutes confused by this before asking a friend, wondering, for example, if simple might be part of the definition of 3-vertex connected, while I did not hesitate to assume that the graphs were finite and undirected. But I understand the balance between brevity / clarity and completeness. Thanks for the article! Greenlinda (talk) 23:08, 26 August 2022 (UTC)