Karen Gunderson

Profile

Select Publications

Name: Karen Gunderson

Position Title: Assistant Professor

Office Phone Number: (204) 474-7486

Email: Karen.Gunderson@umanitoba.ca

Website: http://home.cc.umanitoba.ca/~umjohan1/

Research and Teaching Interests

Graph theory, combinatorics, random graphs, percolation, hypergraphs, extremal combinatorics

Education

M.Sc.University of Manitoba
Ph.D.University of Memphis

Current graduate student

Ruoxin Zhao (M.Sc. Thesi)

Courses taught

MATH 3120 A01
MATH 4260 A01
MATH 7260 A01

Links

http://home.cc.umanitoba.ca/~umjohan1/

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.
Gunderson, Karen; Morrison, Natasha and Semeraro, Jason (2016). Bounding the number of hyperedges in friendship r-hypergraphs. European J. Combin. 51, 125–134.
Bollobás, Béla; Gunderson, Karen; Holmgren, Cecilia; Janson, Svante and Przykucki, Michał (2014).Bootstrap percolation on Galton-Watson trees. Electron. J. Probab. 19, no. 13, 27.
Coker, Tom and Gunderson, Karen (2014). A sharp threshold for a modified bootstrap percolation with recovery. J. Stat. Phys. 157 (3), 531–570.
Gunderson, Karen and Przykucki, Michał (2014). Lower bounds for bootstrap percolation on Galton-Watson trees. Electron. Commun. Probab. 19, no. 42, 7.
Coker, Tom and Johannson, Karen (2012). The adjacent vertex distinguishing total chromatic number.Discrete Math. 312 (17), 2741–2750.
Johannson, Karen Rosemarie (2011). Probabilistic problems in graph theory. ProQuest LLC, Ann Arbor, MI.
Gunderson, David S. and Johannson, Karen R. (2008). On combinatorial upper bounds for van der Waerden numbers W(3;r). In Proceedings of the Thirty-Ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing pp. 33–46.

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.
Gunderson, Karen; Morrison, Natasha and Semeraro, Jason (2016). Bounding the number of hyperedges in friendship r-hypergraphs. European J. Combin. 51, 125–134.
Bollobás, Béla; Gunderson, Karen; Holmgren, Cecilia; Janson, Svante and Przykucki, Michał (2014).Bootstrap percolation on Galton-Watson trees. Electron. J. Probab. 19, no. 13, 27.
Coker, Tom and Gunderson, Karen (2014). A sharp threshold for a modified bootstrap percolation with recovery. J. Stat. Phys. 157 (3), 531–570.
Gunderson, Karen and Przykucki, Michał (2014). Lower bounds for bootstrap percolation on Galton-Watson trees. Electron. Commun. Probab. 19, no. 42, 7.
Coker, Tom and Johannson, Karen (2012). The adjacent vertex distinguishing total chromatic number.Discrete Math. 312 (17), 2741–2750.
Johannson, Karen Rosemarie (2011). Probabilistic problems in graph theory. ProQuest LLC, Ann Arbor, MI.
Gunderson, David S. and Johannson, Karen R. (2008). On combinatorial upper bounds for van der Waerden numbers W(3;r). In Proceedings of the Thirty-Ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing pp. 33–46.