{'fraction_non_alphanumeric': 0.022068965517241378, 'fraction_numerical': 0.001379310344827586, 'mean_word_length': 4.584615384615384, '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}}
Facets of the Bipartite Subgraph Polytope

The bipartite subgraph polytope PBG of a graph G = [V, E] is the convex hull of the incidence vectors of all edge sets of bipartite subgraphs of G. We show that all complete subgraphs of G of odd order and all so-called odd bicycle wheels contained in G induce facets of PBG. Moreover, we describe several methods with which new facet defining inequalities of PBG can be constructed from known ones. Examples of these methods are contraction of node sets in odd complete subgraphs, odd subdivision of edges, certain splittings of nodes, and subdivision of all edges of a cut. Using these methods we can construct facet defining inequalities of PBG having coefficients of order |V|2.