Jerrold R. Griggs

According to our database1, Jerrold R. Griggs authored at least 68 papers between 1977 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
The Saturation Spectrum for Antichains of Subsets.
Order, October, 2023

Sizes of flat maximal antichains of subsets.
CoRR, 2023

2021
Minimum Weight Flat Antichains of Subsets.
Order, 2021

Maximal antichains of subsets I: The shadow spectrum.
CoRR, 2021

2017
Full and maximal squashed flat antichains of minimum weight.
CoRR, 2017

2015
Packing Posets in the Boolean Lattice.
Order, 2015

Poset-free families and Lubell-boundedness.
J. Comb. Theory, Ser. A, 2015

2014
Supersaturation in the Boolean Lattice.
Integers, 2014

2013
The partition method for poset-free families.
J. Comb. Optim., 2013

2012
Diamond-free families.
J. Comb. Theory, Ser. A, 2012

2009
Graph labellings with variable weights, a survey.
Discret. Appl. Math., 2009

On Families of Subsets With a Forbidden Subposet.
Comb. Probab. Comput., 2009

2008
Real Number Channel Assignments for Lattices.
SIAM J. Discret. Math., 2008

No four subsets forming an N.
J. Comb. Theory, Ser. A, 2008

2007
Recent progress in mathematics and engineering on optimal graph labellings with distance conditions.
J. Comb. Optim., 2007

Real Number Labelings for Paths and Cycles.
Internet Math., 2007

2006
Real Number Graph Labellings with Distance Conditions.
SIAM J. Discret. Math., 2006

2005
Optimal Channel Assignments for Lattices with Conditions at Distance Two.
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

2004
Venn Diagrams and Symmetric Chain Decompositions in the Boolean Lattice.
Electron. J. Comb., 2004

2002
Problem 10932.
Am. Math. Mon., 2002

Permutations with Low Discrepancy Consecutive k-sums.
J. Comb. Theory, Ser. A, 2002

On the half?half case of the Zarankiewicz problem.
Discret. Math., 2002

Intersecting families with minimum volume.
Discret. Math., 2002

Foreword.
Discret. Math., 2002

2001
Spanning subset sums for finite Abelian groups.
Discret. Math., 2001

2000
Tiling Rectangles with Trominoes: 10641.
Am. Math. Mon., 2000

The Asymptotics of the Birthday Problem: 10665.
Am. Math. Mon., 2000

1999
Landau's Theorem revisited.
Australas. J Comb., 1999

1998
Extremal graphs with bounded densities of small subgraphs.
J. Graph Theory, 1998

1997
Small Forbidden Configurations.
Graphs Comb., 1997

(0, 1)-Matrices with No Half-Half Submatrix of Ones.
Eur. J. Comb., 1997

The maximum sum of degrees above a threshold in planar graphs.
Discret. Math., 1997

On the distribution of sums of vectors in general position.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996
Edge density and independence ratio in triangle-free graphs with maximum degree three.
Discret. Math., 1996

An application of matching theory of edge-colourings.
Discret. Math., 1996

1995
Planar graphs with few vertices of small degree.
Discret. Math., 1995

Matchings, cutsets, and chain partitions in graded posets.
Discret. Math., 1995

1994
The Channel Assigment Problem for Mutually Adjacent Sites.
J. Comb. Theory, Ser. A, 1994

Independence and the Havel-Hakimi residue.
Discret. Math., 1994

1992
Labelling Graphs with a Condition at Distance 2.
SIAM J. Discret. Math., 1992

Towers of powers and bruhat order.
Eur. J. Comb., 1992

Spanning trees in graphs of minimum degree 4 or 5.
Discret. Math., 1992

On the r-domination number of a graph.
Discret. Math., 1992

1991
Iterated exponentials of two numbers.
Discret. Math., 1991

1990
Representations of families of triples over <i>GF</i>(2).
J. Comb. Theory, Ser. A, 1990

On the number of alignments of <i>k</i> sequences.
Graphs Comb., 1990

1989
Pair Labeelings with Given Distance.
SIAM J. Discret. Math., 1989

Spanning trees with many leaves in cubic graphs.
J. Graph Theory, 1989

Anticlusters and intersecting families of subsets.
J. Comb. Theory, Ser. A, 1989

A minimal cutset of the boolean lattice with almost all members.
Graphs Comb., 1989

1988
Saturated chains of subsets and a random walk.
J. Comb. Theory, Ser. A, 1988

The number of maximal independent sets in a connected graph.
Discret. Math., 1988

Problems on chain partitions.
Discret. Math., 1988

1987
Ramsey-Sperner theory.
Discret. Math., 1987

1986
<i>k</i>-Color Sperner theorems.
J. Comb. Theory, Ser. A, 1986

Families of finite sets with minimum shadows.
Comb., 1986

1985
The lexicographic sum of Cohen-Macaulay and shellable ordered sets.
Graphs Comb., 1985

1984
A Sperner Theorem on Unrelated Chains of Subsets.
J. Comb. Theory, Ser. A, 1984

1983
Lower bounds on the independence number in terms of the degrees.
J. Comb. Theory, Ser. B, 1983

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

On the Tightest Packing of Sums of Vectors.
Eur. J. Comb., 1983

1982
Applied combinatorics, by Alan Tucker, Wiley, New York, 1980, 385 pp. Price: $23.95.
Networks, 1982

1980
Extremal Values of the Interval Number of a Graph.
SIAM J. Algebraic Discret. Methods, 1980

On Chains and Sperner k-Families in Ranked Posets, II.
J. Comb. Theory, Ser. A, 1980

On Chains and Sperner k-Families in Ranked Posets.
J. Comb. Theory, Ser. A, 1980

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

1979
Extremal values of the interval number of a graph, II.
Discret. Math., 1979

1977
A three part Sperner theorem.
Discret. Math., 1977


  Loading...