Professor and Interim Chair, Department of Mathematics, University of South Carolina. Ph.D. in Applied Math, M.I.T., 1977. Research interests include combinatorics, extremal set theory, extremal graph theory, graph coloring, operations research, as well as applications of discrete math to biology, number theory, analysis of algorithms, and communications. Sunset from Point Loma (2006).

Editor-in-Chief, SIAM Journal on Discrete Mathematics. Journal online .

Page Last Updated: January, 2008

E-mail:

chair at math dot sc dot edu

Mail:

J. R. Griggs
Department of Mathematics
University of South Carolina
Columbia, SC 29208 USA

Telephone:

(803) 777-4225(chair office)

FAX:

(803) 777-3783

Lecture Slides

• Real number labellings , presented at DIMACS, Rutgers University (April, 2006).

  ---

  Preprints

• No four subsets form an N , J. R. Griggs and G. O. H. Katona, (May, 2007 version), J. Combinatorial Theory (ser. A) , in press 13 pp. .
• Graph labellings with variable weights, a survey , J. R. Griggs and D. Kral, (Mar., 2007 version), Disc. Appl. Math. , in press 26 pp. .
• Real number channel assignments for lattices, J. R. Griggs and X. T. Jin (April, 2007), SIAM J. Disc. Math., in press 30 pp. .
• Real number labellings for paths and cycles, J. R. Griggs and X. T. Jin, (rev., Sept., 2007), Internet Math. , in press 18 pp. .
• Recent progress in mathematics and engineering on optimal graph labellings with distance conditions, J. R. Griggs and X. T. Jin, J. Combinatorial Optimization , appeared online, (revised Mar., 2007), 11pp. .

  ---

  Published Articles

• 20 years of good advice on the MCM, P. Driscoll, J. R. Griggs, M Parker, P. Boisen, W. P. Fox, M. Tortorella, and P. J. Campbell (2006), COMAP CD, 8 pp. .
• Real number graph labellings with distance conditions , J. R. Griggs and X. T. Jin, to appear, SIAM J. Discrete Math 20 (2006), 302--327, final preprint version (Dec., 2004, rev. Oct., 2005), 30 pp. .
• Optimal channel assignments for lattices with conditions at distance two , J. R. Griggs and X. T. Jin, 8 pp. Extended abstract. Accepted for the 5th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks, at the IEEE International Parallel and Distributed Computing Symposium, April, 2005. .
• Venn diagrams and symmetric chain decompositions in the Boolean lattice J. R. Griggs, C. E. Killian, and C. D. Savage, (revised 2003), Electronic J. Combinatorics 11 (2004), no. R2, 30 pp. .
• Permutations with low discrepancy consecutive k-sums R. Anstee, R. Ferguson, and J. R. Griggs, J. Combinatorial Theory (series A) 100 (2002), 302--321 (version of August, 2002) .
• On the Half-Half Case of the Zarankiewicz Problem
  J. R. Griggs and C.-C. Ho, Discrete Math. 249 (2002), 95--104 .
• Intersecting families with minimum volume
  J. R. Griggs, Discrete Math. 257 (2002), 411--414 .
• Spanning subset sums for finite abelian groups
  J. R. Griggs, Discrete Math. 229 (2001), 89--99 (Proc. Czech-Slovak Colloq. in Combinatorics) .
• Database security and the distribution of subset sums in R^m
  J. R. Griggs, Graph Theory and Combinatorial Biology, Balatonlelle 1996 , Bolyai Math. Studs. 7 (1999), 223--252 .
• On the distribution of sums of vectors in general position
  J. R. Griggs and G. Rote, Proc. DIMATIA-DIMACS Conf. "The Future of Discrete Mathematics", J. Nesetril et al., eds., DIMACS Ser. in Discrete Math. and Theor. Comp. Sci. 49 (1999), 139--142 (version of October, 1997) .
• A new extension of Lubell's inequality to the lattice of divisors
  F. Chudak and J. R. Griggs, Studia Sci. Math. Hungar. 35 (1999), 347--351 (1994 version) .
• Landau's theorem revisited
  J. R. Griggs and K. B. Reid, Australian J. Combinatorics 20 (1999), 19--24 .
• The cycling of partitions and compositions under repeated shifts
  J. R. Griggs and C.-C. Ho, Advances in Appl. Math. 21 (1998), 751--761 .
• Extremal graphs with bounded densities of small subgraphs
  J. R. Griggs, M. Simonovits, and G. R. Thomas, J. Graph Th. 29(1998), 185--207 .
• Concentrating subset sums at k points
  J. R. Griggs, Bull. Institute of Combin. and its Applns. 20 (1997), 65--74 .
• On the distribution of sums of residues
  J. R. Griggs, Bull. A.M.S. 28 (1993), 329--333, (1992 preprint).
  
• Labelling graphs with a condition at distance 2
  , J. R. Griggs and R. K. Yeh, SIAM J. Discrete Math. 5(1992), 586--595 .

Graduate Students

Photos of Paul Erdos
The Kleitman Celebration Conference was held at MIT, August 16-18, 1999:

Poems for Dannyfest

Photos of Daniel J. Kleitman
American Math Society Southeastern Section Meeting, at the University of South Carolina, March, 2001: Combinatorics and Graph Theory was a special session I organized that featured 25 speakers from across the USA and Canada and from as far away as Australia and Germany. This is a page of detailed information on this session and travel to the conference. For digital photos of the meeting, visit David Sumner's gallery.

Click to visit

Malia's Corner

Family Photos

Common Redpoll, which visited our feeder for a few days in February, 2000.

Archilocus Hummingbird, likely Black-chinned, which visited our home for one month in the fall, 2000.

Calliope Hummingbird, immature male, which visited our home for 12 days starting late January, 2003.

Indigo Bunting, adult male, which we found under the deck, active, but unable to fly, in April, 2004. While recuperating, it got out onto the floor. We took it to Carolina Wildlife Care for recovery.

• I have served for years on the Board of Directors of the Mathematics Foundation of America, which oversees the operation of the Canada/USA Mathcamps for gifted students ages 13 to 17. It is designed for the future mathematician. The five-week-long residential summer camp hosts around 100 students at a nice college campus. The 2008 camp will be back at Reed College in Portland, Oregon.
• I have served since 1988 as a judge for the annual Mathematical Contest in Modeling, a "contest where teams of undergraduates use mathematical modeling to present their solutions to real world problems." The Contest is sponsored by COMAP. Several hundred teams enter from around the world. Papers by top teams are published, and several teams are selected to present their papers at meetings of professional societies. I wrote one of the two problems used in 2000 (on efficient channel assignments), in 2001 (efficient evacuation of the South Carolina coast ahead of a major hurricane), in 2004 (amusement park fast passes, jointly with my wife), and in 2005 (flood planning below Lake Murray Dam). I also solicited a problem in 2003 (gamma knife treatment planning). Send us your own ideas--we always need more! As many as 400 teams wrote papers on each problem.

  ---

• Industrial Mathematics Institute.
• University Home Page
• Mathematics Department Home Page