A three part Sperner theorem. - Jerrold R. Griggs; Daniel J. Kleitman (Discret. Math., 1977)

Extremal values of the interval number of a graph, II. - Jerrold R. Griggs (Discret. Math., 1979)

The Littlewood-Offord Problem: Tightest Packing and an M-part Sperner Theorem. - Jerrold R. Griggs (Eur. J. Comb., 1980)

On Chains and Sperner k-Families in Ranked Posets. - Jerrold R. Griggs (J. Comb. Theory A, 1980)

On Chains and Sperner k-Families in Ranked Posets, II. - Jerrold R. Griggs (J. Comb. Theory A, 1980)

Extremal Values of the Interval Number of a Graph. - Jerrold R. Griggs; Douglas B. West (SIAM J. Algebraic Discret. Methods, 1980)

Applied combinatorics, by Alan Tucker, Wiley, New York, 1980, 385 pp. Price: $23.95. - Jerrold R. Griggs (Networks, 1982)

On the Tightest Packing of Sums of Vectors. - Jerrold R. Griggs; Jeffrey C. Lagarias; Andrew M. Odlyzko; James B. Shearer (Eur. J. Comb., 1983)

An Upper Bound on the Ramsey Numbers R(3, k). - Jerrold R. Griggs (J. Comb. Theory A, 1983)

Lower bounds on the independence number in terms of the degrees. - Jerrold R. Griggs (J. Comb. Theory B, 1983)

A Sperner Theorem on Unrelated Chains of Subsets. - Jerrold R. Griggs; Jürgen Stahl; William T. Trotter (J. Comb. Theory A, 1984)

The lexicographic sum of Cohen-Macaulay and shellable ordered sets. - Jerrold R. Griggs; Andrew R. Kustin; Jeffrey A. Ross; Jürgen Stahl (Graphs Comb., 1985)

Families of finite sets with minimum shadows. - Zoltán Füredi; Jerrold R. Griggs (Comb., 1986)

k-Color Sperner theorems. - Jerrold R. Griggs; Andrew M. Odlyzko; James B. Shearer (J. Comb. Theory A, 1986)

Ramsey-Sperner theory. - Zoltán Füredi; Jerrold R. Griggs; Andrew M. Odlyzko; James B. Shearer (Discret. Math., 1987)

Problems on chain partitions. - Jerrold R. Griggs (Discret. Math., 1988)

The number of maximal independent sets in a connected graph. - Jerrold R. Griggs; Charles M. Grinstead; David R. Guichard (Discret. Math., 1988)

Saturated chains of subsets and a random walk. - Jerrold R. Griggs (J. Comb. Theory A, 1988)

A minimal cutset of the boolean lattice with almost all members. - Zoltán Füredi; Jerrold R. Griggs; Daniel J. Kleitman (Graphs Comb., 1989)

Anticlusters and intersecting families of subsets. - Jerrold R. Griggs; James W. Walker (J. Comb. Theory A, 1989)

Spanning trees with many leaves in cubic graphs. - Jerrold R. Griggs; Daniel J. Kleitman; Aditya Shastri (J. Graph Theory, 1989)

Pair Labeelings with Given Distance. - Zoltán Füredi; Jerrold R. Griggs; Daniel J. Kleitman (SIAM J. Discret. Math., 1989)

On the number of alignments of k sequences. - Jerrold R. Griggs; Phil Hanlon; Andrew M. Odlyzko; Michael S. Waterman (Graphs Comb., 1990)

Representations of families of triples over GF(2). - Zoltán Füredi; Jerrold R. Griggs; Ron Holzman; Daniel J. Kleitman (J. Comb. Theory A, 1990)

Iterated exponentials of two numbers. - Jerrold R. Griggs (Discret. Math., 1991)

On the r-domination number of a graph. - Jerrold R. Griggs; Joan P. Hutchinson (Discret. Math., 1992)

Spanning trees in graphs of minimum degree 4 or 5. - Jerrold R. Griggs; Mingshen Wu (Discret. Math., 1992)

Towers of powers and bruhat order. - Jerrold R. Griggs; Michelle L. Wachs (Eur. J. Comb., 1992)

Labelling Graphs with a Condition at Distance 2. - Jerrold R. Griggs; Roger K. Yeh (SIAM J. Discret. Math., 1992)

Independence and the Havel-Hakimi residue. - Jerrold R. Griggs; Daniel J. Kleitman (Discret. Math., 1994)

The Channel Assigment Problem for Mutually Adjacent Sites. - Jerrold R. Griggs (J. Comb. Theory A, 1994)

Matchings, cutsets, and chain partitions in graded posets. - Jerrold R. Griggs (Discret. Math., 1995)

Planar graphs with few vertices of small degree. - Jerrold R. Griggs; Yan-Chyuan Lin (Discret. Math., 1995)

An application of matching theory of edge-colourings. - Richard P. Anstee; Jerrold R. Griggs (Discret. Math., 1996)

Edge density and independence ratio in triangle-free graphs with maximum degree three. - Jerrold R. Griggs; Owen Murphy (Discret. Math., 1996)

On the distribution of sums of vectors in general position. - Jerrold R. Griggs; Günter Rote (Contemporary Trends in Discrete Mathematics, 1997)

The maximum sum of degrees above a threshold in planar graphs. - Jerrold R. Griggs; Yan-Chyuan Lin (Discret. Math., 1997)

(0, 1)-Matrices with No Half-Half Submatrix of Ones. - Jerrold R. Griggs; Jianxin Ouyang (Eur. J. Comb., 1997)

Small Forbidden Configurations. - Richard P. Anstee; Jerrold R. Griggs; Attila Sali (Graphs Comb., 1997)

Extremal graphs with bounded densities of small subgraphs. - Jerrold R. Griggs; Miklós Simonovits; George Rubin Thomas (J. Graph Theory, 1998)

Landau's Theorem revisited. - Jerrold R. Griggs; K. B. Reid (Australas. J Comb., 1999)

The Asymptotics of the Birthday Problem: 10665. - Jerrold R. Griggs; Darryl K. Nester; Sung Soo Kim (Am. Math. Mon., 2000)

Tiling Rectangles with Trominoes: 10641. - Jerrold R. Griggs; Michael Woltermann; B. Borchers; David Callan; Robin J. Chapman; J. Chilcott; Paul Cull; A. Ferguson; K. Martin; G. G. Gagola; Solomon W. Golomb; J. Guilford; et al. (Am. Math. Mon., 2000)

Spanning subset sums for finite Abelian groups. - Jerrold R. Griggs (Discret. Math., 2001)

Foreword. - Lenore Cowen; Jerrold R. Griggs; Douglas B. West (Discret. Math., 2002)

Intersecting families with minimum volume. - Jerrold R. Griggs (Discret. Math., 2002)

On the half?half case of the Zarankiewicz problem. - Jerrold R. Griggs; Chih-Chang Ho (Discret. Math., 2002)

Permutations with Low Discrepancy Consecutive k-sums. - Richard P. Anstee; Ron Ferguson; Jerrold R. Griggs (J. Comb. Theory A, 2002)

Problem 10932. - Christian Bey; Jerrold R. Griggs (Am. Math. Mon., 2002)

Venn Diagrams and Symmetric Chain Decompositions in the Boolean Lattice. - Jerrold R. Griggs; Charles E. Killian; Carla D. Savage (Electron. J. Comb., 2004)

Optimal Channel Assignments for Lattices with Conditions at Distance Two. - Jerrold R. Griggs; Xiaohua Teresa Jin (IPDPS, 2005)

Real Number Graph Labellings with Distance Conditions. - Jerrold R. Griggs; Xiaohua Teresa Jin (SIAM J. Discret. Math., 2006)

Real Number Labelings for Paths and Cycles. - Jerrold R. Griggs; Xiaohua Teresa Jin (Internet Math., 2007)

Recent progress in mathematics and engineering on optimal graph labellings with distance conditions. - Jerrold R. Griggs; Xiaohua Teresa Jin (J. Comb. Optim., 2007)

No four subsets forming an N. - Jerrold R. Griggs; Gyula O. H. Katona (J. Comb. Theory A, 2008)

Real Number Channel Assignments for Lattices. - Jerrold R. Griggs; Xiaohua Teresa Jin (SIAM J. Discret. Math., 2008)

On Families of Subsets With a Forbidden Subposet. - Jerrold R. Griggs; Linyuan Lu (Comb. Probab. Comput., 2009)

Graph labellings with variable weights, a survey. - Jerrold R. Griggs; Daniel Král (Discret. Appl. Math., 2009)

Diamond-free families. - Jerrold R. Griggs; Wei-Tian Li; Linyuan Lu (J. Comb. Theory A, 2012)

The partition method for poset-free families. - Jerrold R. Griggs; Wei-Tian Li (J. Comb. Optim., 2013)

Supersaturation in the Boolean Lattice. - Andrew P. Dove; Jerrold R. Griggs; Ross J. Kang; Jean-Sébastien Sereni (Integers, 2014)

Poset-free families and Lubell-boundedness. - Jerrold R. Griggs; Wei-Tian Li (J. Comb. Theory A, 2015)

Packing Posets in the Boolean Lattice. - Andrew P. Dove; Jerrold R. Griggs (Order, 2015)

Full and maximal squashed flat antichains of minimum weight. - Jerrold R. Griggs; Sven Hartmann; Thomas Kalinowski; Uwe Leck; Ian T. Roberts (CoRR, 2017)

Maximal antichains of subsets I: The shadow spectrum. - Jerrold R. Griggs; Thomas Kalinowski; Uwe Leck; Ian T. Roberts; Michael Schmitz 005 (CoRR, 2021)

Minimum Weight Flat Antichains of Subsets. - Jerrold R. Griggs; Sven Hartmann; Thomas Kalinowski; Uwe Leck; Ian T. Roberts (Order, 2021)

The Saturation Spectrum for Antichains of Subsets. - Jerrold R. Griggs; Thomas Kalinowski; Uwe Leck; Ian T. Roberts; Michael Schmitz 005 (Order, 2023)

Sizes of Flat Maximal Antichains of Subsets. - Jerrold R. Griggs; Thomas Kalinowski; Uwe Leck; Ian T. Roberts; Michael Schmitz 005 (Order, 2025)