Karen Gunderson
Assistant Professor
Office | 467 Machray Hall |
---|---|
(204) 474-7486 |
Personal page: http://server.math.umanitoba.ca/~kgunderson
Education
M.Sc. | University of Manitoba |
Ph.D. | University of Memphis |
Research interests
Graph theory, combinatorics, random graphs, percolation, hypergraphs, extremal combinatorics
Recent Publications
- Aldridge, Matthew; Baldassini, Leonardo and Gunderson, Karen (2017). Almost separable matrices. J. Comb. Optim. 33 (1), 215–236.
- Gunderson, Karen; Koch, Sebastian and Przykucki, Michał (2017). The time of graph bootstrap percolation. Random Structures Algorithms 51 (1), 143–168.
- Gunderson, Karen and Semeraro, Jason (2017). Tournaments, 4-uniform hypergraphs, and an exact extremal result. J. Combin. Theory Ser. B 126, 114–136.
- Balister, Paul; Bollobás, Béla and Gunderson, Karen (2016). Positive independence densities of finite rank countablehypergraphs are achieved by finite hypergraphs. European J. Combin. 57, 85–93.
- Bushaw, Neal; Gunderson, Karen and Kalikow, Steven (2016). Random Markov processes for countable and uncountable alphabets. Israel J. Math. 216 (1), 181–214.
Current graduate student
- Ruoxin Zhao (M.Sc. Thesis)