Affirming a conjecture of Erdo s and Re nyi we prove that for any (real number) c 1 >0 for some c 2 >0, if a graph G has no c 1 (log n) nodes on which the graph is complete or edgeless (i.e., G exemplifies |G | Ä % (c 1 log n) 2 2 ), then G has at least 2 c 2 n non-isomorphic (induced) subgraphs. 1
On a problem of Erdős and Graham
✍ Scribed by Béla Bollobás; Norbert Hegyvári; Guoping Jin
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 211 KB
- Volume
- 175
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper we shall answer a question of Erd6s and Graham (1980, p. 18) concerning sums of integer sequences. Furthermore, we shall examine for what sequences (ri, ci)~l it is true that if B = (bi) is a sequence of natural numbers such bi+l >~ribi -c~ then, for some sequence A = (ai)~=l of natural numbers with 2 <~ai+l -ai ~<3, we have (A + A)n B ¢ 0.
📜 SIMILAR VOLUMES
We prove a special case of a conjecture of Erdo s and Rosenfeld regarding factor difference sets of integers.
Here we have an example for six points in the plane no three on a line no four on a circle, and no one equidistant from three others, such that they determine 5 distinct distances, one occurring once, one twice, one three times, one four times, and one five times, and the configuration does not cont