✦ LIBER ✦

On the number of k-subsets of a set of n points in the plane

✍ Scribed by Jacob E Goodman; Richard Pollack

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 175 KB
Volume: 36
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(84)90081-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Number of Directions Determined b

On the Number of Directions Determined by a Set of Points in an Affine Galois Plane

✍ Tamás Szőnyi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 265 KB

In this paper the number of directions determined by a set of q&n points of AG(2, q) is studied. To such a set we associate a curve of degree n and show that its linear components correspond to points that can be added to the set without changing the set of determined directions. The existence of li

The number of different distances determ

The number of different distances determined by n points in the plane

✍ F.R.K Chung 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 494 KB

On the number of flats spanned by a set

On the number of flats spanned by a set of points in PG(d, q)

✍ Endre Boros; Roy Meshulam 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 116 KB

It is shown that for fixed 1 ~ 0, if X C PG (d, q) contains (1 + ~)q~ points, then the number of r-fiats spanned by X is at least C(r.)q (r+l)ts+l-r), i.e. a positive fraction of the number of r-fiats in PG(s + 1,q).

Graphs embedded in the plane with a boun

Graphs embedded in the plane with a bounded number of accumulation points

✍ C. Paul Bonnington; R. Bruce Richter 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB 👁 1 views

## Abstract Halin's Theorem characterizes those infinite connected graphs that have an embedding in the plane with no accumulation points, by exhibiting the list of excluded subgraphs. We generalize this by obtaining a similar characterization of which infinite connected graphs have an embedding in

On the number of critical points of the

On the number of critical points of the period

✍ S.-N Chow; J.A Sanders 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 554 KB

Partitions of the 4-subsets of a 13-set

Partitions of the 4-subsets of a 13-set into disjoint projective planes

✍ Leo G. Chouinard II 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 422 KB

For I G t < k CI u. let S(t, k, u) denote a Steiner system and let Pr, (u) be the set of all k-subsets of theset {i,2,..., u}. We partition PJ 13) into 55 mutually disjoint S(2.4, 13)'s (projective planes). This is the first known example of a complete partition of Pk(u) into disjoint S(t, k, u)'s f