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>davidgunderson

David Gunderson

Profile
Select Publications
David Gunderson
Senior Scholar
(204) 474-6925
David.Gunderson@umanitoba.ca

Research and Teaching Interests

Combinatorics, including Ramsey theory, extremal set theory, discrete geometry

Education

  • B.Sc. Calgary
  • M.Sc. Calgary
  • Ph.D. Emory

Current graduate students

  • Sergii Tsaturian (Ph.D.)
  • Suraj Srinivasan (M.Sc. Thesis)

Courses taught

  • MATH 3380 A01
  • MATH 8210 T07

Links

http://home.cc.umanitoba.ca/~gunderso/
https://www.ams.org/mathscinet/MRAuthorID/317429
https://www.genealogy.math.ndsu.nodak.edu/id.php?id=2167

  • Arman, Andrii; Gunderson, David S. and Tsaturian, Sergei (2016). Triangle-free graphs with the maximum number of cycles. Discrete Math. 339 (2), 699–711.
  • Durocher, Stephane; Gunderson, David S. and Li, Pak Ching and Skala, Matthew (2015). Cycle-maximal triangle-free graphs. Discrete Math. 338 (2), 274–290.
  • Elsholtz, Christian and Gunderson, David S. (2015). Congruence properties of multiplicative functions on sumsets and monochromatic solutions of linear equations. Funct. Approx. Comment. Math. 52 (2), 263–281.
  • Füredi, Zoltan and Gunderson, David S. (2015). Extremal numbers for odd cycles. Combin. Probab. Comput. 24 (4), 641–645.
  • Gunderson, David S.; Hindman, Neil and Lefmann, Hanno (2014). Some partition theorems for infinite and finite matrices. Integers 14, Paper No. A12, 20.
  • Gunderson, David S. and Lefmann, Hanno (2013). Graphs on affine and linear spaces and Deuber sets. Electron. J. Combin. 20 (2), Paper 47, 15.
  • Gunderson, David S. (2011). Handbook of mathematical inductionDiscrete Mathematics and its Applications (Boca Raton). CRC Press, Boca Raton, FL.
  • Grätzer, G.; Gunderson, D. S. and Quackenbush, R. W. (2009). The spectrum of a finite pseudocomplemented lattice. Algebra Universalis 61 (3-4), 407–411.
  • Ardal, Hayri; Gunderson, David S.; Jungić, Veselin and Landman, Bruce M. and Williamson, Kevin (2008/09). Ramsey results involving the Fibonacci numbers. Fibonacci Quart. 46/47 (1), 10–17.
  • 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.
  • Bisztriczky, Tibor; Böŗ̈zky, Jr., Károly and Gunderson, David S. (2003). Cyclic polytopes, hyperplanes, and Gray codes. J. Geom. 78 (1-2), 25–49.
  • Gunderson, David S.; Leader, Imre and Prömel, Hans J̈̊gen and R”l̈, Vojt ̌ech (2003). Independent Deuber sets in graphs on the natural numbers. J. Combin. Theory Ser. A 103 (2), 305–322.
  • Alon, N.; Erd ̋os, P.; Gunderson, D. S. and Molloy, M. (2002). A Ramsey-type problem and the Turán numbers. J. Graph Theory 40 (2), 120–129.
  • Gunderson, David S. (2002). On Deuber’s partition theorem for (m,p,c)-sets. Ars Combin. 63, 15–31.
  • Gunderson, David S.; Leader, Imre and Prömel, Hans J̈̊gen and R”l̈, Vojt ̌ech (2001). Independent arithmetic progressions in clique-free graphs on the natural numbers. J. Combin. Theory Ser. A 93 (1), 1–17.
  • Gunderson, David S.; Rödl, Vojt ̌ech and Sidorenko, Alexander (1999). Extremal problems for sets forming Boolean algebras and complete partite hypergraphs. J. Combin. Theory Ser. A 88 (2), 342–367.
  • Gunderson, David S. and Rödl, Vojt ̌ech (1998). Extremal problems for affine cubes of integers.Combin. Probab. Comput. 7 (1), 65–79.
  • Deuber, W. A.; Erd ̋os, P.; Gunderson, D. S. and Kostochka, A. V. and Meyer, A. G. (1997). Intersection statements for systems of sets. J. Combin. Theory Ser. A 79 (1), 118–132.
  • Deuber, Walter; Gunderson, David and Hindman, Neil and Strauss, Dona (1997). Independent finite sums for Km-free graphs. J. Combin. Theory Ser. A 78 (2), 171–198.
  • Erd ̋os, P.; Füredi, Z.; Gould, R. J. and Gunderson, D. S. (1995). Extremal graphs for intersecting triangles. J. Combin. Theory Ser. B 64 (1), 89–100.
  • Gunderson, David Shane (1995). Extremal problems on Boolean algebras, sum-sets of integers, and hypergraphs. ProQuest LLC, Ann Arbor, MI.
  • Gunderson, David S.; Rödl, Vojt ̌ech and Sauer, Norbert W. (1993). Finite induced graph Ramsey theory: on partitions of subgraphs. J. Combin. Theory Ser. B 59 (2), 199–209.
  • Gunderson, David S.; Rödl, Vojt ̌ech and Sauer, Norbert W. (1990). Some results in finite graph Ramsey theory. In Proceedings of the Twenty-first Southeastern Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1990) pp. 232–243.
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