{'fraction_non_alphanumeric': 0.015337423312883436, 'fraction_numerical': 0.0, 'mean_word_length': 4.360655737704918, '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}}
Linear Arboricity of Random Regular Graphs

A linear forest is a forest in which each connected component is a path. The linear arboricity la(G) of a graph G is the least number of linear forests required to cover the edges of G. The linear arboricity conjecture is equivalent to the assertion that for every r-regular graph G