##
**Zentralblatt MATH**

**Publications of (and about) Paul Erdös**

**Zbl.No: ** 429.05047

**Autor: ** Erdös, Paul

**Title: ** Some old and new problems in various branches of combinatorics. (In English)

**Source: ** Proc. 10th southeast. Conf. Combinatorics, graph theory and computing, Boca Raton 1979, Vol. I, Congr. Numerantium 23, 19-37 (1979).

**Review: ** [For the entire collection see Zbl 418.00002.]

The author begins by listing eighteen earlier papers of his consisting mainly of open problems in combinatorial mathematics. Then he gives a progress report on some of his favorite problems and states a few recent problems. Finally, he gives a proof of the following result. Let A(m; k) denote the least common multiple of m+1,...,m+k, and let m_{k} be the smallest integer for which A(m_{k}; k) > A(m_{k}+k; k); then m_{k}(k ––> oo as k ––> oo.

**Reviewer: ** J.W.Moon

**Classif.: ** * 05C35 Extremal problems (graph theory)

00A07 Problem books

05B99 Designs and configurations

05C15 Chromatic theory of graphs and maps

11A99 Elementary number theory

**Keywords: ** extremal problems; random graphs; chromatic graphs

**Citations: ** Zbl.418.00002

© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag