Timeline for Can you determine whether a graph is the 1-skeleton of a polytope?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 18, 2021 at 4:21 | history | edited | Martin Sleziak | CC BY-SA 4.0 |
http -> https (the question was bumped anyway)
|
| Jul 24, 2010 at 14:46 | comment | added | Vinayak Pathak | Then, do we know of a theorem that characterizes the 1-skeleton of some other kind of polytopes (i.e., not necessarily convex)? | |
| Jul 24, 2010 at 9:36 | comment | added | Sam Nead | Convex, I would guess? | |
| Jul 24, 2010 at 4:18 | comment | added | Vinayak Pathak | I wonder what he meant by "similar theorem". Did he mean that a theorem characterizing the 1-skeleton of convex polytopes is not known or that a theorem characterizing the 1-skeleton of general polytopes is not known? | |
| Dec 18, 2009 at 20:27 | comment | added | David Eppstein | Günter Ziegler writes in his Lectures on Polytopes that "No similar theorem is known, and it seems that no similarly effective theorem is possible, in higher dimensions." | |
| Dec 18, 2009 at 11:40 | comment | added | Hans-Peter Stricker | OK, but in arbitrary dimension? | |
| Dec 18, 2009 at 11:34 | history | answered | Sam Nead | CC BY-SA 2.5 |