{'fraction_non_alphanumeric': 0.06657963446475196, 'fraction_numerical': 0.01174934725848564, 'mean_word_length': 3.705521472392638, 'pattern_counts': {'":': 0, '<': 2, '<?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}}
Estimation of the k-Orientability Threshold

Let G(n,m) be an undirected random graph with n vertices and m multiedges that may include loops, where each edge is realized by choosing its two vertices independently and uniformly at random with replacement from the set of all n vertices. The random graph G(n,m) is said to be k-orientable, where k ges 2 is an integer, if there exists an orientation of the edges such that the maximum out-degree is at most k. Let ck = sup {c : G(n,cn) is k-orientable w.h.p.}. We prove that for k large enough, 1 - 2k exp (-k + 1 + e-k/4) < ck/k < 1- exp (-2k(1- e-2k)),and the time ckn is a threshold for the emergence of a giant subgraph of size Theta(n) whose edges are more than k times its vertices. Other results are presented.