A note on the chromatic number of the square of a sparse random graph
Abstract
We show that w.h.p the list chromatic number of the square of Gn,p for p=c/n is asymptotically equal to the maximum degree (Gn,p). Since (G2n,p)≤ (G2n,p), this also improves an earlier result of Garapaty et al KLMP who proved that (G2n,p) ≤ 6 · (Gn,p) w.h.p.
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.