Articles
 
         
   


 
 

REFEREED PUBLICATIONS
[MR = Mathematical Reviews]

 

1.  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            Post Script

 

2.  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            Post Script

 

3.  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            Post Script

 

4.  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            Post Script

 

5.  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            Post Script

 

6.  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            Post Script

 

7.  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            Post Script

 

8.  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            Post Script

 

9.  D. S. Gunderson, On Deuber's partition theorem for (m, p, c)-sets, Ars Combinatoria 63 (2002), 15-31. [MR 2003c:05021]

PDF            Post Script

 

10.  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            Post Script

 

11.  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            Post Script

 

12.  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            Post Script

 

Preprints, SUBMITTED MANUSCRIPTS, AND WORKS IN PROGRESS

 

1.  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.

2.  D. S. Gunderson, A Hall of shame, Mathlinks, 2 pages.
PDF

3.  D. S. Gunderson, The number e, Mathlinks, 3 pages.
PDF


4.  D. S. Gunderson, The RSA encryption algorithm, Mathlinks, 2 pages.
PDF

5.  D. S. Gunderson, V. Rödl, and A. Sidorenko, On sets forming Boolean algebras and partite hypergraphs, 33 pages.
PDF

6.  D. S. Gunderson, Finite projective planes and applications in combinatorics, in progress, 143 pages.

7.  D. S. Gunderson, Ramsey theory for induced structures, in progress, 200 pages.

8.  D. S. Gunderson, Mathematical induction, book, in progress, 550 pages.

9.  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

10.  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.