Timeline for Can we find lattice polyhedra with faces of area 1,2,3,...?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Mar 9, 2016 at 22:51 | history | suggested | Vigod | CC BY-SA 3.0 |
Adding the 11-face golyhedron
|
| Mar 9, 2016 at 22:28 | review | Suggested edits | |||
| S Mar 9, 2016 at 22:51 | |||||
| S Mar 9, 2016 at 20:07 | history | suggested | Vigod | CC BY-SA 3.0 |
As pointed by Sebastian, the Euler characteristic doesn't have to be 1
|
| Mar 9, 2016 at 19:58 | review | Suggested edits | |||
| S Mar 9, 2016 at 20:07 | |||||
| Mar 9, 2016 at 19:25 | comment | added | Sebastian Goette | Your first formula looks like the Euler characteristic of a planar graph. Is it clear that the adjacency graph you describe is always planar (what about a cube with sidelength 3 - I counted $V=9$, $E=54$, so $L=46$ - which loops are those)? Or is it clear that the Euler-like formula continues to hold if the graph is not planar? Anyway, the example in the other answer has a planar graph, so there your argument works. | |
| Mar 9, 2016 at 18:35 | review | Late answers | |||
| Mar 9, 2016 at 19:33 | |||||
| Mar 9, 2016 at 18:20 | review | First posts | |||
| Mar 9, 2016 at 19:25 | |||||
| Mar 9, 2016 at 18:18 | history | answered | Vigod | CC BY-SA 3.0 |