{'fraction_non_alphanumeric': 0.04051172707889126, 'fraction_numerical': 0.006396588486140725, 'mean_word_length': 3.8958333333333335, '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 leaf number in graphs with forbidden subgraphs

Abstract Let G be a simple, connected graph. The leaf number, L(G) of G, is defined as the maximum number of leaf vertices contained in a spanning tree of G. Assume that G is a triangle−free graph with minimum degree δ, order n and leaf number L(G). We show that for δ = 4 and δ = 5, where cδ is a constant that depends on δ only. Similar bounds are shown to hold for triangle−free and C4−free graphs.