{'fraction_non_alphanumeric': 0.010178117048346057, 'fraction_numerical': 0.0, 'mean_word_length': 4.880597014925373, '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}}
LOWER BOUNDS ON THE CHEEGER CONSTANTS OF HIGHLY CONNECTED REGULAR GRAPHS

We develop a method for obtaining lower bounds on the Cheeger constants of certain highly connected graphs. We then apply this technique to obtain new lower bounds on the Cheeger constants of two important families of graphs. Finally, we discuss the relevance of our bounds to determining the integrity of these graphs.