𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The number of triangles covering the center of ann-set

✍ Scribed by E. Boros; Z. Füredi

Publisher
Springer
Year
1984
Tongue
English
Weight
338 KB
Volume
17
Category
Article
ISSN
0046-5755

No coin nor oath required. For personal study only.

✦ Synopsis

Let the points PI, P2 .... , P~ be given in the plane such that there are no three on a line. Then there exists a point of the plane which is contained in at least n3/27 (open) P~P~Pk triangles. This bound is the best possible.

📜 SIMILAR VOLUMES

Open-Invariant Measures and the Covering
Open-Invariant Measures and the Covering Number of Sets
✍ Hermann Haase 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 598 KB

A reault of J. MYCIELSIZI ssp that on every metric space (X, e) with a non-empty compact thick set C X there exists a repbr open-invsriant BOREL measure p with p(C) = 1. p is mlled open-invariant if p(A) = p(B) for open isometric sets A, 3 X. We relste this result to the notion of a Hrrwm~-S~~omms~

The number of triangles in 2-factorizati
The number of triangles in 2-factorizations
✍ Qidi Sui; Beiliang Du 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB

## Abstract Given an arbitrary 2‐factorization ${\cal F} = {F\_{1},F\_{2}, \cdots , F\_{v - 1/2}}$ of $K\_{v}$, let δ~__i__~ be the number of triangles contained in __F~i~__, and let δ = Σδ~__i__~. Then $\cal F$ is said to be a 2‐factorization with δ triangles. Denote by Δ(__v__), the set of all δ

The Covering Number of the GroupPSLn(F)
The Covering Number of the GroupPSLn(F)
✍ Arieh Lev 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 253 KB

Let G be the group PSL F , where n G 3, F is a field, and F G 4. Assume, n further, that if n s 3, then F is either finite or algebraically closed. Given an k Ä 4 integer k and a subset A : G, denote A s a a иии a ¬ a , a , . . . , a g A . 1 2 k 1 2 k Ž . k Denote by cn G the minimal value of k such

The chromatic covering number of a graph
The chromatic covering number of a graph
✍ Reza Naserasr; Claude Tardif 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB 👁 2 views

Following [1] , we investigate the problem of covering a graph G with induced subgraphs G 1 ; . . . ; G k of possibly smaller chromatic number, but such that for every vertex u of G, the sum of reciprocals of the chromatic numbers of the G i 's containing u is at least 1. The existence of such ''ch