David S. Gunderson

According to our database1, David S. Gunderson authored at least 15 papers between 1993 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
Triangle-free graphs with the maximum number of cycles.
Discrete Mathematics, 2016

2015
Cycle-maximal triangle-free graphs.
Discrete Mathematics, 2015

Extremal Numbers for Odd Cycles.
Combinatorics, Probability & Computing, 2015

2013
Graphs on Affine and Linear Spaces and Deuber Sets.
Electr. J. Comb., 2013

2007
Biologically-inspired adaptive learning control strategies: A rough set approach.
Int. J. Hybrid Intell. Syst., 2007

2003
Independent Deuber sets in graphs on the natural numbers.
J. Comb. Theory, Ser. A, 2003

2002
A Ramsey-type problem and the Turán numbers.
Journal of Graph Theory, 2002

On Deuber's partition theorem for (m, p, c)-sets.
Ars Comb., 2002

2001
Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers.
J. Comb. Theory, Ser. A, 2001

1999
Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs.
J. Comb. Theory, Ser. A, 1999

1998
Extremal Problems for Affine Cubes of Integers.
Combinatorics, Probability & Computing, 1998

1997
Independent Finite Sums forKm-Free Graphs.
J. Comb. Theory, Ser. A, 1997

Intersection Statements for Systems of Sets.
J. Comb. Theory, Ser. A, 1997

1995
Extremal Graphs for Intersecting Triangles.
J. Comb. Theory, Ser. B, 1995

1993
Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs.
J. Comb. Theory, Ser. B, 1993


  Loading...