Timeline for Vertices of a Polytope
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 8, 2013 at 6:46 | comment | added | Günter Rote | Indeed, fullerenes are a good example. Almost all of the surface is a hexagonal lattice, and there you can simultaneously cut away vertices as long as their minimum distance is 2. Thus, you can cut away half of the vertices (almost; staying away from the pentagons). | |
| Oct 8, 2013 at 3:13 | comment | added | SashaKolpakov | @GuenterRote: in dimension three you may wish to consider fullerenes (liga.ens.fr/~deza/Sem-FullCCirmVirusSpFull/FFullereneConf.pdf) as an example of polytopes with many vertices of degree 3 sufficiently far from each other. I think it works, when you cut a number of vertices of a fullerene by triangles, since fullerenes have 5- and 6-gonal faces only. The number of vertices of a fullerene is generally unbounded. | |
| Oct 7, 2013 at 19:50 | history | answered | Günter Rote | CC BY-SA 3.0 |