Turán Numbers of Multiple Paths and Equibipartite Forests. - Neal Bushaw; Nathan Kettle (Comb. Probab. Comput., 2011)

Turán Numbers for Forests of Paths in Hypergraphs. - Neal Bushaw; Nathan Kettle (SIAM J. Discret. Math., 2014)

The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups. - Neal Bushaw; Maurício Collares Neto; Robert Morris 001; Paul Smith (Comb. Probab. Comput., 2015)

The typical structure of graphs with no large cliques. - József Balogh; Neal Bushaw; Maurício Collares Neto; Hong Liu 010; Robert Morris 001; Maryam Sharifzadeh (Comb., 2017)

Automated Conjecturing VII: The Graph Brain Project & Big Mathematics. - Neal Bushaw; Craig E. Larson; Nicolas Van Cleemput (CoRR, 2018)

A note on bootstrap percolation thresholds in plane tilings using regular polygons. - Neal Bushaw; Daniel W. Cranston (Australas. J Comb., 2019)

Forbidding Multiple Copies of Forestable Graphs. - Neal Bushaw; Nathan Kettle (Graphs Comb., 2020)

Rainbow Saturation. - Neal Bushaw; Daniel Johnston; Puck Rombach (Graphs Comb., 2022)

Bootstrap percolation via automated conjecturing. - Neal Bushaw; Blake Conka; Vinay Gupta; Aidan Kierans; Hudson Lafayette; Craig E. Larson; Kevin McCall; Andriy Mulyar; Christine Sullivan; Scott Taylor; Evan Wainright; Evan Wilson; et al. (Ars Math. Contemp., 2023)

Sets of vertices with extremal energy. - Neal Bushaw; Brent Cody; Chris Leffler (Discret. Math., 2025)

Thresholds for pebbling on grids. - Neal Bushaw; Nathan Kettle (Discret. Math., 2025)

Rainbow Turán methods for trees. - Vic Bednar; Neal Bushaw (Australas. J Comb., 2025)