The following combinatorial problem, which arose in game theory, is solved here: To tind a selt of vertices of ;P given size (in t.k nxube) which has a maximal number sf interconnecting edges,
A note on triangulating the 5-cube
โ Scribed by Mark N. Broadie; Richard W. Cottle
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 888 KB
- Volume
- 52
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We give a triangulation of the 6-cube into 308 simplices; this is the smallest number in any triangulation of I6 presented so far.
## lhc mctJiotl of mnniifiicturing Iiicqiicr is as follows : The resin is pliicctl in :i copl)cr-bot.toiiictl pot over ii giis or fuel-oil firr rind houglit up to tlic required tcmpcraturc~. Aftrr ii ccrtiiin tlcgrcc of liqucficiition hirs becn rciichctl t he oil is nddctl. Continuiil stirring is
This paper deals with the largest interior angle property of the Voronoi nearest neighbours and the Delaunay triangulation in two dimensions. It is indicated that each interior angle opposite to an edge of a Delaunay triangle is the largest of the interior angles opposite the same edge of all possib