{'fraction_non_alphanumeric': 0.022222222222222223, 'fraction_numerical': 0.005555555555555556, 'mean_word_length': 4.918032786885246, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
On Robillard′s Bounds for Ramsey Numbers

A recent issue of the Bulletin contained a paper by Robillard [13] in which results from the theory of confounded factorial designs were used to obtain some lower bounds for Ramsey numbers. We shall derive, by more elementary methods, bounds which are much better than Robillard's in every example which he considered.