✦ LIBER ✦

On the number of disjoint increasing paths in the one-skeleton of a convex body leading to a given exposed face

✍ Scribed by S. Gallivan

Book ID: 112886982
Publisher: The Hebrew University Magnes Press
Year: 1979
Tongue: English
Weight: 285 KB
Volume: 32
Category: Article
ISSN: 0021-2172
DOI: 10.1007/bf02764921

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Further results on increasing paths in t

Further results on increasing paths in the one-skeleton of a convex body

✍ S. Gallivan; D. G. Larman 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 526 KB

Increasing Paths on the One-Skeleton of

Increasing Paths on the One-Skeleton of a Convex Body and the Directions of Line Segments on the Boundary of a Convex Body

✍ Larman, D. G.; Rogers, C. A. 📂 Article 📅 1971 🏛 Oxford University Press 🌐 English ⚖ 288 KB

On the Maximal Number of Edges in Graphs

On the Maximal Number of Edges in Graphs with a Given Number of Edge-Disjoint Triangles

✍ Sauer, N. 📂 Article 📅 1971 🏛 Oxford University Press 🌐 English ⚖ 98 KB

On the mean number of normals through a

On the mean number of normals through a point in the interior of a convex body

✍ Daniel Hug 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 944 KB

On the Maximum Number of Touching Pairs

On the Maximum Number of Touching Pairs in a Finite Packing of Translates of a Convex Body

✍ Károly Bezdek 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 102 KB

Minkowski space M d =(R d , || ||) is just R d with distances measured using a norm || ||. A norm || || is completely determined by its unit ball {x ¥ R d | ||x|| [ 1} which is a centrally symmetric convex body of the d-dimensional Euclidean space E d . In this note we give upper bounds for the maxi

On the equivalence in complexity among t

On the equivalence in complexity among three computation problems on maximum number of edge-disjoint s−t paths in a probabilistic graph

✍ Pen Cheng; Shigeru Masuyama 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 396 KB