Timeline for Exactly counting number of vertices of a polyhedron
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 7, 2021 at 0:58 | comment | added | Brendan McKay | It's not my field of expertise, sorry. | |
| Apr 5, 2021 at 12:53 | vote | accept | Turbo | ||
| Apr 5, 2021 at 12:51 | comment | added | Brendan McKay | Make a square pyramid using 5 planes. It has 5 vertices. If you cut off the apex with an extra plane you get 8 vertices, but if you cut off one of the corners of the base you get 7 vertices. | |
| Apr 5, 2021 at 12:48 | comment | added | Turbo | Can you please provide an example pairing to illustrate? | |
| Apr 5, 2021 at 12:48 | comment | added | Brendan McKay | My answer is the same. The number of vertices is not a function of $n,r,t,r'$ even in 3-d. | |
| Apr 5, 2021 at 12:28 | comment | added | Turbo | I provided update. | |
| Apr 5, 2021 at 6:51 | history | answered | Brendan McKay | CC BY-SA 4.0 |