Search In
/g>
  • A-Z Index
  • Faculty & Staff Resources
  • Jump
  • Make a Gift
  • UM Learn
  • Webmail
  • Search
Search
Search In
  • Home
  • People
  • Research
  • Graduate Info
    • Graduate Programs
    • Graduate studies financial
    • Admission Into the Graduate Programs
    • Courses
    • Supplementary Regulations
    • Comprehensive Examinations
    • Thesis Proposal
    • Graduate students resources
    • Graduate Seminars
    • Graduate Mathematics Society
  • Undergraduate Info
    • Courses
    • Undergraduate Programs
    • Admissions
    • Archived Exams
    • Undergraduate Awards
    • Science Co-op
    • Financial Information for Undergraduates
    • Mathematics Help Centre
    • Levelup Program
    • XMXL
  • News & Events
    • Seminars
    • Events
    • MathCamp – Grade 9 & 10 Summer Camp
    • M.A.G.I.C. – Girls Summer Math Camp
  • Resources
    • Jobs
    • Statement on Academic Misconduct
    • Links
    • Newsletters
    • Fun Facts
    • Reading Room
    • Elections
    • Crowdmark
    • Committees
    • Department Council Bylaws
    • Covid19 – Building Access Log
  • About Us
    • History
Home>profiles>karengunderson

Karen Gunderson

Profile
Select Publications
Karen Gunderson
Assistant Professor
(204) 474-7486
Karen.Gunderson@umanitoba.ca
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.
Contact & Social Media
Asset 8
MAKE
A GIFT

Department of Mathematics
420 Machray Hall, 186 Dysart Road University of Manitoba, Winnipeg, MB R3T 2N2 Canada
Phone: 204-474-8703 Fax: 204-474-7611 EMAIL: mathematics_dept@umanitoba.ca
@ 2018 UNIVERSITY OF MANITOBA