{'fraction_non_alphanumeric': 0.014705882352941176, 'fraction_numerical': 0.01050420168067227, 'mean_word_length': 4.129032258064516, '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}}
The structure of graphs with no 
W
4 immersion

This paper gives a precise structure theorem for the class of graphs which do not contain W 4 as an immersion. This strengthens a previous result of Belmonte et al. that gives a rough description of this class. In fact, we prove a stronger theorem concerning rooted immersions of W 4 where one terminal is specified in advance. This stronger result is key in a forthcoming structure theorem for graphs with no K 3 , 3 immersion.