𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A solution to a colouring problem of P. Erdős

✍ Scribed by Herbert Fleischner; Michael Stiebitz

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
596 KB
Volume
101
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a Problem of Erdős
On a Problem of Erdős
✍ Csaba Sándor 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 236 KB

Theorem 1. For every n 2 there exist integers 1<a 1 <a 2 < } } } <a s such that s i=1 1Âa i <n and this sum cannot be split into n parts so that all partial sums are 1.

Solution of two problems of P. Erdős con
Solution of two problems of P. Erdős concerning Hamiltonian cycles
✍ P. Horák; J. S̆irán̆ 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 421 KB

We present a solution of two problems of P. Erdijs on packing a set of r graphs into the complete graph on n vertices in such a way that each Hamiltonian cycle of the complete graph has common edges with each of the r packed graphs.

On a Problem of Erdős and Sárközy
On a Problem of Erdős and Sárközy
✍ Tomasz Schoen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 89 KB

Let A=[a 1 , a 2 , ...] N and put A(n)= a i n 1. We say that A is a P-set if no element a i divides the sum of two larger elements. It is proved that for every P-set A with pairwise co-prime elements the inequality A(n)<2n 2Â3 holds for infinitely many n # N. ## 2001 Academic Press where A(n)= a i

A Minimax Problem Admitting the Equiosci
A Minimax Problem Admitting the Equioscillation Characterization of Bernstein and Erdős
✍ Ying Guang Shi 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 190 KB

This paper shows that under certain conditions a solution of the minimax problem min a<x 1 < } } } <x n <b max 1 i n+1 f i (x 1 , ..., x n ) admits the equioscillation characterizations of Bernstein and Erdo s and has strong uniqueness. This problem includes as a particular example the optimal Lagra