Publications of (and about) Paul Erdös
Autor: Erdös, Paul
Title: Problems and results in combinatorial analysis and combinatorial number theory. (In English)
Source: Alavi, Yousef (ed.) et al., Graph theory, combinatorics, and applications, Vol. 1. Proceedings of the sixth quadrennial international conference on the theory and applications of graphs held at Western Michigan University, Kalamazoo, Michigan, May 30-June 3, 1988. New York: John Wiley & Sons Ltd. Wiley-Interscience Publication. 397-406 (1991).
Review: The author discusses several results and open problems in combinatorial analysis and combinatorial number theory. The following two indicate the flavor of the paper: 1. The graph H(n) determined by the vertices of the n-dimensional cube has 2n vertices and n2n- 1 edges. Let Fk(n) be the smallest integer for which every subgraph of H(n) having fk(n) edges contains a C2k. The author conjectured more than 25 years ago that, for n > n0(\epsilon), f1(n) < (1/2 +\epsilon)n2n- 1, i.e., slightly more than half the edges of H(n) force a C4. Presently, he considers it surprising that this simple and attractive conjecture is still open. 2. Let \alpha1 < \alpha2 < ··· be an infinite sequence of integers for which all the triple sums \alphai+\alphaj+\alphal are distinct. The author states that he is offering 500 dollars for a proof or disproof of the old conjecture of his that lim\alphan/n3 = oo.
Reviewer: A.N.Philippou (MR 93g: 05136)
Classif.: * 05C99 Graph theory
11B75 Combinatorial number theory
00A07 Problem books
Keywords: open problems; combinatorial analysis; combinatorial number theory; conjecture; infinite sequence of integers
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag