When is ch(K(m,n))=m-1?
Abstract
Let nm be the smallest integer n such that ch(Km,n) = m-1, where ch(G) denotes the choice (list chromatic) number of the graph G. We prove that there is an infinite sequence of integers S, such that if m is in S, then nm <= 0.4643 ((m-2)(m-2)). If m -> infinity, then nm is asymptotically at most 0.474 ((m-2)(m-2)).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.