Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs. - Paul Balister; Béla Bollobás; Karen Gunderson (Eur. J. Comb., 2016)

Bounding the number of hyperedges in friendship r-hypergraphs. - Karen Gunderson; Natasha Morrison; Jason Semeraro (Eur. J. Comb., 2016)

Almost separable matrices. - Matthew Aldridge; Leonardo Baldassini; Karen Gunderson (J. Comb. Optim., 2017)

Tournaments, 4-uniform hypergraphs, and an exact extremal result. - Karen Gunderson; Jason Semeraro (J. Comb. Theory B, 2017)

The time of graph bootstrap percolation. - Karen Gunderson; Sebastian Koch; Michal Przykucki (Random Struct. Algorithms, 2017)

Bootstrap Percolation and Galton-Watson Trees (Keynote Speakers). - Karen Gunderson (AofA, 2018)

Minimum Degree Conditions for Small Percolating Sets in Bootstrap Percolation. - Karen Gunderson (Electron. J. Comb., 2020)

Burning the Plane. - Anthony Bonato; Karen Gunderson; Amy Shaw (Graphs Comb., 2020)

Induced forests in some distance-regular graphs. - Karen Gunderson; Karen Meagher; Joy Morris; Venkata Raghu Tej Pantangi (Discret. Appl. Math., 2024)

Adversarial graph burning densities. - Karen Gunderson; William Kellough; J. D. Nir; Hritik Punj (Discret. Math., 2025)

Turán numbers and switching. - Karen Gunderson; Jason Semeraro (Discret. Math., 2025)