Preprint
Oct 2026
Optimal path decompositions of sparse random graphs
The proof combines a local pairing argument based on the lopsided Lov\'asz local lemma with cycle decompositions of random graphs with cycle decompositions of random graphs.
Ji-Fu Lin, He-Mao Yang
· 0 citations