User:162.238.217.96

A new upgrade to USGCS Called USGCS_2

\(\text{USGCS}_2(k)\) is the least integer \(N\) such that, setting \(S = \mathbb{Q}^k \cup \mathbb{Q}^{k+1}\), every order invariant digraph \(G\) has an upper shift greedy clique sequence of length at most \(N\) with an open thread. 162.238.217.96 02:01, July 21, 2018 (UTC)