Published Work
Go to:
Refereed Publications
- D. S. Gunderson, V. Rödl, and N. Sauer, Some results in finite
graph Ramsey theory, Congressus Numerantium 79
(1990), 232-243. [MR 92k:05093]
PDF PS - D. S. Gunderson, V. Rödl, and N. Sauer, Finite induced graph
Ramsey theory: on partitions of subgraphs, J. Combin. Th. Ser. B
59 (1993), 199-209. [MR 94j:05087]
PDF PS - P. Erdős, Z. Füredi, R. Gould, and D. S. Gunderson, Extremal
graphs for intersecting triangles, J. Combin. Th. Ser. B 64
(1995), 89-100. [MR 96e:05080]
PDF PS - W. Deuber, D. S. Gunderson, N. Hindman, and D. Strauss,
Independent finite sums for Km-free graphs, J. Combin.
Th. Ser. A 78 (1997) 171-198. [MR98d:05140]
PDF PS - D. S. Gunderson and V. Rödl, On extremal problems for affine
cubes of integers, Combin. Probab. Comput. 7
(1998), 65-79. [MR 99a:11015]
PDF PS - W. A. Deuber, P. Erdős, D. S. Gunderson, A. V. Kostochka, and A.
G. Meyer, Intersection statements for systems of sets, J. Combin.
Th. Ser. A 79 (1997), 118-132. [MR 98f:05144]
PDF PS - D. S. Gunderson, V. Rödl, and A. Sidorenko, Extremal problems
for sets forming Boolean algebras and complete partite hypergraphs, J.
Combin. Th. Ser. A 88 (1999), 342-367. [MR
2000i:05131]
PDF PS - D. S. Gunderson, I. Leader, H. J. Prömel, and V. Rödl,
Independent arithmetic progressions in clique-free graphs on the
natural numbers, J. Combin. Th. Ser. A 93
(2001), 1-17.
PDF PS - D. S. Gunderson, On Deuber's partition theorem for (m, p,
c)-sets, Ars Combinatoria 63 (2002), 15-31.
[MR 2003c:05021]
PDF PS - N. Alon, P. Erdős, D. S. Gunderson, and M. Molloy, On a Ramsey
type problem and the Turán numbers, J. Graph Th. 40
(2002), 120-129. [MR2003d:05139]
PDF PS - D. S. Gunderson, I. Leader, H. J. Prömel, and V. Rödl,
Independent Deuber sets in graphs on the natural numbers, J.
Combin. Th. Ser. A. 103 (2003), 305-322. [MR
1996069 (2004h:05123)]
PDF PS - T. Bisztriczky, K. Böröczky and D. S. Gunderson, Cyclic
polytopes, hyperplanes, and Gray codes, J. Geom. 78
(2003), no. 1-2, 25-49. [MR 2031563]
PDF PS - J. F. Peters, M. Borkowski, C. Henry, D. Lockery, D. S. Gunderson, Line-Crawling Bots that Inspect Electric Power Transmission Line Equipment. in Proc. Third Int. Conference on Autonomous Robots and Agents (ICARA 2006), Palmerston North, New Zealand, 2007, 39-44.
- J. F. Peters, C. Henry, D. S. Gunderson, Biologically-inspired approximate adaptive learning control strategies: a rough set approach, International Journal of Hybrid Intelligent Systems, 4 (no. 4) (2007), 203-216.
- D. S. Gunderson and K. R. Johannson, On combinatorial upper bounds for the van der Waerden numbers W(3;r), Congr. Numer. 190 (2008), 33-46. [MR 2489790]
- G. Grätzer, D. S. Gunderson, and R. W. Quackenbush, The spectrum of a finite pseudocomplemented lattice, Algebra Universalis 61 (2009), 407-411. [MR 2565862]
- H. Ardal, D. S. Gunderson, V. Jungić, B. M. Landman, and K. Williamson, Ramsey results involving the Fibonacci numbers, Fibonacci Quart. 46/47 (2008/09), 10-17. [MR 2494620] (Published February 2009)
- D. S. Gunderson and H. Lefmann, Graphs on affine and linear spaces and Deuber sets, The Electronic Journal of Combinatorics 20 (2) (2013), P47 (15 pages).
Articles for student publications
- Classic puzzles: False proofs, Manitoba Mathlinks,
Winter 2007, 4-7.
- "Nathan Mendelsohn, 1917-2006", Manitoba Mathlinks,
Fall 2006, 7.
- Classic puzzles, Manitoba Mathlinks, Winter 2006, 2.
- The π is the limit, Manitoba Mathlinks, Spring 2005, 6-7.
- Classic puzzles, Manitoba Mathlinks, Winter 2005, 5.
- Definitions with e's, Manitoba Mathlinks,
Winter 2004, 5-6.
- A Hall of shame, Manitoba Mathlinks, Winter 2003, 1, 5-6: PDF
- The number e, Manitoba Mathlinks, 3 pages: PDF
- The RSA encryption algorithm, Manitoba Mathlinks, Spring 2003, 4-5. PDF
Preprints, submitted works, and works in progess
- Z. Füredi and D. S. Gunderson, Extremal numbers for odd cycles, 2013, arXiv:1310.6766 [math.CO].
- S. Durocher, D. S. Gunderson, P.C. Li, and M. Skala, Cycle-maximal triangle-free graphs, 2013, 32 pages, arXiv:1310.5172 [math.CO].
- P. Balister and D. S. Gunderson, On the number of distinct distances in permuations, 6 pages.
- C. Elsholtz and D. S. Gunderson, On extremal partite graphs and generalized Zarankiewicz numbers, 40 pages.
- C. Elsholtz and D. S. Gunderson, On congruence properties of completely multiplicative functions, 14 pages.
- D. S. Gunderson and W. Kocay, Great circle graphs, in progess.
- D. S. Gunderson, On Frankl's union-closed conjecture, manuscript, in progress.
- W. Deuber, D. S. Gunderson, N. Hindman, and D. Strauss, Independent finite sums for Km-free graphs, Preprint 96-042, SFB 343, Diskrete Strukturen in der Mathematik, Universität Bielefeld, 27 pages.
- D. S. Gunderson, V. Rödl, and A. Sidorenko, On sets forming
Boolean algebras and partite hypergraphs, 33 pages.
PDF - D. S. Gunderson and V. Rödl, An alternative proof of
Szemerédi's cube lemma using extremal hypergraphs, Preprint
95-110, SFB 343, Diskrete Strukturen in der Mathematik, Universität
Bielefeld, 12 pages.
PDF - D. S. Gunderson and V. Rödl, Extremal problems for affine cubes of integers, Preprint 95-109, SFB 343, Diskrete Strukturen in der Mathematik, Universität Bielefeld, 16 pages.
- D. S. Gunderson and V. Rödl, On discrepancy of finite projective planes, preprint.
- D. S. Gunderson, Ramsey theory, book, in progress, 250 pages.
- D. S. Gunderson, The probabilistic method for engineers, manuscript, 2006, 95 pages, written for Math 8219 notes.
- D. S. Gunderson, Introduction to graph theory, 26
pages, written for use by graduate studens, and for Math 440 and 4410
background review.