Packing Nearly Optimal Ramsey R(3, t) Graphs. - He Guo 002; Lutz Warnke (Comb., 2020)

Rainbow cycles for families of matchings. - Ron Aharoni; He Guo 002 (CoRR, 2021)

Algorithmic approaches to problems in probabilistic combinatorics. - He Guo 002 (2021)

Rainbow cycles for matchings, single edges, and triangles. - He Guo 002 (CoRR, 2022)

On the power of random greedy algorithms. - He Guo 002; Lutz Warnke (Eur. J. Comb., 2022)

Tight infinite matrices. - Ron Aharoni; He Guo 002 (CoRR, 2023)

Looms. - Ron Aharoni; Eli Berger; Joseph Briggs; He Guo 002 (CoRR, 2023)

2-covers of wide Young diagrams. - Ron Aharoni; Eli Berger; He Guo 002; Daniel Kotlar (CoRR, 2023)

Nonuniform Degrees and Rainbow Versions of the Caccetta-Häggkvist Conjecture. - Ron Aharoni; Eli Berger; Maria Chudnovsky; He Guo 002; Shira Zerbib (SIAM J. Discret. Math., 2023)

Prague Dimension of Random Graphs. - He Guo 002; Kalen Patton; Lutz Warnke (Comb., 2023)

Bounds on Ramsey games via alterations. - He Guo 002; Lutz Warnke (J. Graph Theory, 2023)

Looms. - Ron Aharoni; Eli Berger; Joseph Briggs; He Guo 002; Shira Zerbib (Discret. Math., 2024)

Short rainbow cycles for families of matchings and triangles. - He Guo 002 (J. Graph Theory, 2025)