{'fraction_non_alphanumeric': 0.03305785123966942, 'fraction_numerical': 0.011570247933884297, 'mean_word_length': 5.0, '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}}
RecognizingP3-Structure: A Switching Approach

AP3is a set of three vertices of a graph that induces a chordless path; theP3-structure of a graph is the set of allP3's. Chvatal asked if there is a polynomial time algorithm to determine whether an arbitrary three-uniform hypergraph is theP3-structure of some graph. The answer is yes: we describe such an algorithm. Our algorithm is based on switching (as defined by Seidel), a characterization of graphs with the sameP3-structure, a sufficient condition forP3-structure uniqueness, and a reduction of a certain partitioning problem to two-satisfiability.