{'fraction_non_alphanumeric': 0.024193548387096774, 'fraction_numerical': 0.004032258064516129, 'mean_word_length': 4.916666666666667, '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}}
An Algorithm for Detecting Intrinsically Knotted Graphs

We describe an algorithm that recognizes some (possibly all) intrinsically knotted (IK) graphs and can help find knotless embeddings for graphs that are not IK. The algorithm, implemented as a Mathematica program, has already been used in [Goldberg et al. 14] to greatly expand the list of known minor minimal IK graphs and to find knotless embeddings for some graphs that had previously resisted attempts to classify them as IK or non-IK.