𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a combinatorial problem. II

✍ Scribed by P. Erdős

Publisher
Akadmiai Kiad
Year
1964
Tongue
English
Weight
133 KB
Volume
15
Category
Article
ISSN
1588-2632

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a Combinatorial Problem from the Mode
On a Combinatorial Problem from the Model Theory of Wreath Products, II
✍ Dan Saracino 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 133 KB

We continue the investigation of a combinatorial problem concerning multisets of equivalence relations on a finite set. ## 1999 Academic Press We denote the least such d by $(r, n). It is easy to see [2] that $(r, 2)=2 r&2 when r is even, while $(r, 2) is undefined when r is odd. Some other values

A combinatorial problem
A combinatorial problem
✍ J. A. Thas 📂 Article 📅 1973 🏛 Springer 🌐 English ⚖ 177 KB
On a problem in combinatorial geometry
On a problem in combinatorial geometry
✍ Vojtěch Rödl 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 253 KB

Let us fix a number a, O< a < 2. We join two p0int.s on the unit sphere Sm in the real m-space iff their distance is a. Denote the obtained graph by g,,,. We prove that the chromatic number x(9@,,,) tends to infinity when m --+ a. This gives a positive answer to a question of P. Erdiis.

A Combinatorial Problem on Finite Abelia
A Combinatorial Problem on Finite Abelian Groups
✍ W.D. Gao 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 186 KB

In this paper the following theorem is proved. Let G be a finite Abelian group of order n. Then, n+D(G )&1 is the least integer m with the property that for any sequence of m elements a 1 , ..., a m in G, 0 can be written in the form 0= a 1 + } } } +a in with 1 i 1 < } } } <i n m, where D(G) is the