Richard Duke
Professor of Mathematics
Georgia Institute of Technology

phone: (404)-894-9202
fax: 404-894-4409
email: duke@math.gatech.edu
office: Skiles 117

EDUCATIONAL BACKGROUND:

A.B. 1959, Kenyon College, Mathematics

M.A. 1961, Dartmouth College, Mathematics

Ph.D. 1965, Univ. of Virginia, Mathematics

CURRENT FIELDS OF INTEREST:

Combinatorics (Graph Theory, Finite Set Systems)

SAMPLE PUBLICATIONS:

A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph, SIAM Journal of Computing Vol. 24, No. 3 (1995), pp. 598-620 (with H. Lefmann and V. Rödl).

On Uncrowded Hypergraphs, Random Structures and Algorithms, Vol. 6, No. 2,3 (1995), pp. 209-212 (with H. Lefmann and V. Rödl).

The Erdös-Ko-Rado Theorem for Small Families, J. Combinatorial Theory, Ser. A, vol. 65, No. 2 (1994), pp. 246-251 (with V. Rödl).

The Algorithmic Aspects of the Regularity Lemma, extended abstract in Proc. 33rd Annual IEEE FOCS, IEEE (1992), pp. 473- 481, and in J. of Algorithms vol. 16 (1994), pp. 80-109, (with N. Alon, H. Lefmann, V. Rödl, and R. Yuster).

Cycle-connected Graphs, Discrete Math., Vol. 108 (1992) pp. 261-278 and in "Topological, Algebraic, and Combinatorial Methods," (J. Nestrl, ed.) Annals of Discrete Mathematics Series, Vol. 33, North Holland, 1992, (with P. Erdös and V. Rödl).