On the Expected Number of Shadow Vertices of the Convex Hull of Random Points
✍ Scribed by K.-H. Küfer
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 287 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0885-064X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
This note can be treated a s a supplement to a paper written by Bollobas which was devoted to the vertices of a given degree in a random graph. We determine some values of the edge probability p for which the number of vertices of a given degree of a random graph G E ?An, p) asymptotically has a nor
This paper presents an inequality satisfied by planar graphs of minimum degree five. For the purposes of this paper, an edge of a graph is light if the weight of the edge, or the sum of the degrees of the vertices incident with it, is at most eleven. The inequality presented shows that planar graph
Using oriented matroids, and with the help of a computer, we have found a set of 10 points in R 4 not projectively equivalent to the vertices of a convex polytope. This result confirms a conjecture of Larman [6] in dimension 4.