Lunhui: Upcycled Creations. - Mengyu Cao (Creativity & Cognition, 2017)

On even-cycle-free subgraphs of the doubled Johnson graphs. - Mengyu Cao; Benjian Lv; Kaishun Wang (Appl. Math. Comput., 2021)

Extremal even-cycle-free subgraphs of the complete transposition graphs. - Mengyu Cao; Benjian Lv; Kaishun Wang; Sanming Zhou (Appl. Math. Comput., 2021)

The structure of large non-trivial t-intersecting families of finite sets. - Mengyu Cao; Benjian Lv; Kaishun Wang (Eur. J. Comb., 2021)

Treewidth of the Generalized Kneser Graphs. - Ke Liu; Mengyu Cao; Mei Lu (Electron. J. Comb., 2022)

Nontrivial t-Intersecting Families for Vector Spaces. - Mengyu Cao; Benjian Lv; Kaishun Wang; Sanming Zhou (SIAM J. Discret. Math., 2022)

On the P3-hull numbers of q-Kneser graphs and Grassmann graphs. - Jiaqi Liao; Mengyu Cao; Mei Lu (Appl. Math. Comput., 2023)

r-cross t-intersecting families for vector spaces. - Mengyu Cao; Mei Lu; Benjian Lv; Kaishun Wang (J. Comb. Theory A, 2023)

Triangles in r-wise t-intersecting families. - Jiaqi Liao; Mengyu Cao; Mei Lu (Eur. J. Comb., 2023)

Nearly extremal non-trivial cross t-intersecting families and r-wise t-intersecting families. - Mengyu Cao; Mei Lu; Benjian Lv; Kaishun Wang (Eur. J. Comb., 2024)

Erdős-Ko-Rado theorem for bounded multisets. - Jiaqi Liao; Zequn Lv; Mengyu Cao; Mei Lu (J. Comb. Theory, Ser. A, 2024)

Treewidth of the q-Kneser graphs. - Mengyu Cao; Ke Liu; Mei Lu; Zequn Lv (Discret. Appl. Math., 2024)