Talk:Polyhedral graph

This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Mathematics Low‑priority This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles Low This article has been rated as Low-priority on the project's priority scale. Polyhedra This article is within the scope of WikiProject Polyhedra, a collaborative effort to improve the coverage of polygons, polyhedra, and other polytopes on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.PolyhedraWikipedia:WikiProject PolyhedraTemplate:WikiProject PolyhedraPolyhedra articles ??? This article has not yet received a rating on the project's importance scale.

More strongly, there exists a constant α < 1 (the shortness exponent) and an infinite family of polyhedral graphs such that the length of the longest simple path of an n-vertex graph in the family is O(n^α).

Isn't the word "cubic" missing in that sentence? --MathsPoetry (talk) 08:48, 14 February 2013 (UTC)[reply]

I think you could define a shortness exponent for cubic polyhedral graphs, and for polyhedral graphs more generally, but it might not be the same exponent. —David Eppstein (talk) 15:28, 14 February 2013 (UTC)[reply]

Then the word is not missing.

As you have understood it, the previous order of sentences was misleading with respect to current hypotheses. Great that you have changed it. --MathsPoetry (talk) 20:50, 14 February 2013 (UTC)[reply]