𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The number of labeled dissections of ak-ball

✍ Scribed by L. W. Beineke; R. E. Pippert

Publisher
Springer
Year
1971
Tongue
English
Weight
620 KB
Volume
191
Category
Article
ISSN
0025-5831

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Closed Forms for the Number of Polygon D
Closed Forms for the Number of Polygon Dissections
✍ Petr LisonΔ›k πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 178 KB

We consider unlabelled dissections of the regular s-gon into \(r\) cells by means of nonintersecting diagonals. We prove that if the parameter \(r\) is fixed then the number of dissections is quasi-polymonial in \(s\).

On the number of cylinders touching a ba
On the number of cylinders touching a ball
✍ AladΓ‘r Heppes; LΓ‘szlΓ³ SzabΓ³ πŸ“‚ Article πŸ“… 1991 πŸ› Springer 🌐 English βš– 248 KB

The following problem is due to W. Kuperberg. What is the maximum number of non-overlapping unit cylinders (a set in E 3 consisting of points whose distance from some line does not exceed I) that can be simultaneously tangent to a unit ball? In this paper we prove that this number is at most 8. It i

Number of labeled 4-regular graphs
Number of labeled 4-regular graphs
✍ R. C. Read; N. C. Wormald πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 305 KB

## Abstract Several operations on 4‐regular graphs and pseudographs are analyzed and equations are obtained relating the numbers of these graphs on given numbers of labeled points. These equations are used recursively to find the numbers of 4‐regular graphs on up to 13 labeled points.