The list color function threshold of K_{2,l}
Abstract
tau(K_{2,l}) =Theta[atTop] sqrt l over l in Nat, for tau the list color function threshold, the smallest k >= chi(G) with P_l(G,m) = P(G,m) for every m >= k, defined by sInf over a set proved nonempty, on the actual mathlib completeBipartiteGraph (Fin 2) (Fin l). Also: for m >= 4 and 2l <= (m-1)^2, every m-assignment of K_{2,l} has at least m(m-1)^l + m(m-1)(m-2)^l proper list colourings.
AI-assisted research preprint. Internal independent AI review is not external journal peer review. Exact source versions, formal coverage and bounded novelty limits are retained in the paper and supporting qualifications.
Supplementary files
Comments
Related problem 353552. Proof sources supplied as gzip+base64 proof-sources.json, extract_sources.py, and supporting.zip. No worldwide-priority certification.