Skip to content

Author

He-Mao Yang

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

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

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.