A theorem concerning closed polygons
✍ Scribed by I. S. Gàl
- Book ID
- 112746707
- Publisher
- Springer
- Year
- 1948
- Tongue
- English
- Weight
- 268 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0373-3114
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Let P be a family of simple polygons in the plane. If every three (not necessarily distinct) members of P have a simply connected union and every two members of P have a nonempty intersection, then N{P:P in P) ¢ ¢. Applying the result to a finite family C of orthogonally convex polygons, the set fq{
## P(c, m). If the edges of a countable injinite complete graph G are exactly c-colored, then there exists a countable infinite complete subgraph H of G whose edges are exactly m-colored. The purpose of this note is to inquire as to which pairs c, m of positive integers make P(c, m) a true stateme