#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1980

2017

- This year (0)
- Last 5 years (6)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Walter A. Deuber, Paul ErdÃ¶s, David S. Gunderson, Alexandr V. Kostochka, A. G. Meyer
- J. Comb. Theory, Ser. A
- 1997

A family of r sets is called a 2-system if any two sets have the same intersection. Denote by F(n, r) the most number of subsets of an n-element set which do not contain a 2-system consisting of râ€¦ (More)

- David S. Gunderson, Vojtech RÃ¶dl, Alexander Sidorenko
- J. Comb. Theory, Ser. A
- 1999

Three classes of finite structures are related by extremal properties: complete d-partite d-uniform hypergraphs, d-dimensional affine cubes of integers, and families of 2 sets forming a d-dimensionalâ€¦ (More)

- David S. Gunderson, Vojtech RÃ¶dl
- Combinatorics, Probability & Computing
- 1998

A collection H of integers is called an affine d-cube if there exist d+ 1 positive integers x0, x1, . . . , xd so that H = { x0 + âˆ‘ iâˆˆI xi : I âŠ† {1, 2, . . . , d} } . We address both density andâ€¦ (More)

- Paul ErdÃ¶s, ZoltÃ¡n FÃ¼redi, Ronald J. Gould, David S. Gunderson
- J. Comb. Theory, Ser. B
- 1995

It is known that for a graph on n vertices bn2/4c + 1 edges is sufficient for the existence of many triangles. In this paper, we determine the minimum number of edges sufficient for the existence ofâ€¦ (More)

- Gunther Franz Craun, David G Greathouse, David S. Gunderson
- International journal of epidemiology
- 1981

The EPA limit for nitrate (10 mg/l No3-N) in drinking water was established to prevent infantile methaemoglobinemia, an acute condition confined almost exclusively to infants less than three months.â€¦ (More)

- David S. Gunderson, Imre Leader, Hans JÃ¼rgen PrÃ¶mel, Vojtech RÃ¶dl
- J. Comb. Theory, Ser. A
- 2003

We show that for any k,m, p, c, if G is a Kk-free graph on N then there is an independent set of vertices in G that contains an (m, p, c)-set. Hence if G is a Kk-free graph on N, then one can solveâ€¦ (More)

- Noga Alon, Paul ErdÃ¶s, David S. Gunderson, Michael Molloy
- Journal of Graph Theory
- 2002

For each n and k, we examine bounds on the largest number m so that for any k-coloring of the edges of Kn there exists a copy of Km whose edges receive at most k 1 colors. We show that for kâ€¦ (More)

A collection H of integers is called an aane d-cube if there exist d + 1 positive) : In 1969, Szemer edi found a density result for aane cubes, namely, that for any positive integer d, there exists aâ€¦ (More)

Let A be a finite or infinite matrix with integer entries and only finitely many nonzero entries in each row. Then A is image partition regular (over N) provided whenever N is finitely colored, thereâ€¦ (More)

For each n and k, we examine bounds on the largest number m so that for any k-coloring of the edges of Kn there exists a copy of Km whose edges receive at most k âˆ’ 1 colors. We show that for k â‰¥ âˆšn+â€¦ (More)