On the number of alternating paths in random graphs. - Patrick Bennett; Ryan Cushman; Andrzej Dudek (Discret. Appl. Math., 2021)

Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process. - Patrick Bennett; Ryan Cushman; Andrzej Dudek (SIAM J. Discret. Math., 2021)

An Evolving Network Model from Clique Extension. - Anthony Bonato; Ryan Cushman; Trent G. Marbach; Zhiyuan Zhang (COCOON, 2022)

Iterative models for complex networks formed by extending cliques. - Anthony Bonato; Ryan Cushman; Trent G. Marbach; Zhiyuan Zhang (CoRR, 2022)

The localization game on oriented graphs. - Anthony Bonato; Ryan Cushman; Trent G. Marbach; Brittany Pittman (Discret. Appl. Math., 2023)

The Erdős-Gyárfás function f(n,4,5)=56n+o(n) - So Gyárfás was right. - Patrick Bennett; Ryan Cushman; Andrzej Dudek; Pawel Pralat (J. Comb. Theory B, 2024)

The frustum network model based on clique extension. - Anthony Bonato; Ryan Cushman; Trent G. Marbach; Zhiyuan Zhang (J. Comb. Optim., 2024)

A Note on Non-Isomorphic Edge-Color Classes in Random Graphs. - Patrick Bennett; Ryan Cushman; Andrzej Dudek; Elizabeth Sprangel (Graphs Comb., 2024)

Generalized Ramsey Numbers at the Linear and Quadratic Thresholds. - Patrick Bennett; Ryan Cushman; Andrzej Dudek (Electron. J. Comb., 2025)