default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJerrold R. Griggs
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j63]Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck, Ian T. Roberts, Michael Schmitz
:
The Saturation Spectrum for Antichains of Subsets. Order 40(3): 537-574 (2023)- [i4]Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck, Ian T. Roberts, Michael Schmitz:
Sizes of flat maximal antichains of subsets. CoRR abs/2302.07062 (2023) - 2021
- [j62]Jerrold R. Griggs, Sven Hartmann, Thomas Kalinowski, Uwe Leck, Ian T. Roberts:
Minimum Weight Flat Antichains of Subsets. Order 38(3): 441-453 (2021) - [i3]Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck, Ian T. Roberts, Michael Schmitz:
Maximal antichains of subsets I: The shadow spectrum. CoRR abs/2106.02226 (2021)
2010 – 2019
- 2017
- [i2]Jerrold R. Griggs, Sven Hartmann, Thomas Kalinowski, Uwe Leck, Ian T. Roberts:
Full and maximal squashed flat antichains of minimum weight. CoRR abs/1704.00067 (2017) - 2015
- [j61]Jerrold R. Griggs, Wei-Tian Li:
Poset-free families and Lubell-boundedness. J. Comb. Theory A 134: 166-187 (2015) - [j60]Andrew P. Dove, Jerrold R. Griggs:
Packing Posets in the Boolean Lattice. Order 32(3): 429-438 (2015) - 2014
- [j59]Andrew P. Dove, Jerrold R. Griggs, Ross J. Kang, Jean-Sébastien Sereni:
Supersaturation in the Boolean Lattice. Integers 14A: A4 (2014) - 2013
- [j58]Jerrold R. Griggs, Wei-Tian Li:
The partition method for poset-free families. J. Comb. Optim. 25(4): 587-596 (2013) - [i1]Andrew P. Dove, Jerrold R. Griggs, Ross J. Kang, Jean-Sébastien Sereni:
Supersaturation in the Boolean lattice. CoRR abs/1303.4336 (2013) - 2012
- [j57]Jerrold R. Griggs, Wei-Tian Li, Linyuan Lu:
Diamond-free families. J. Comb. Theory A 119(2): 310-322 (2012)
2000 – 2009
- 2009
- [j56]Jerrold R. Griggs, Linyuan Lu:
On Families of Subsets With a Forbidden Subposet. Comb. Probab. Comput. 18(5): 731-748 (2009) - [j55]Jerrold R. Griggs, Daniel Král:
Graph labellings with variable weights, a survey. Discret. Appl. Math. 157(12): 2646-2658 (2009) - 2008
- [j54]Jerrold R. Griggs, Gyula O. H. Katona:
No four subsets forming an N. J. Comb. Theory A 115(4): 677-685 (2008) - [j53]Jerrold R. Griggs, Xiaohua Teresa Jin:
Real Number Channel Assignments for Lattices. SIAM J. Discret. Math. 22(3): 996-1021 (2008) - 2007
- [j52]Jerrold R. Griggs, Xiaohua Teresa Jin:
Real Number Labelings for Paths and Cycles. Internet Math. 4(1): 65-86 (2007) - [j51]Jerrold R. Griggs, Xiaohua Teresa Jin:
Recent progress in mathematics and engineering on optimal graph labellings with distance conditions. J. Comb. Optim. 14(2-3): 249-257 (2007) - 2006
- [j50]Jerrold R. Griggs, Xiaohua Teresa Jin:
Real Number Graph Labellings with Distance Conditions. SIAM J. Discret. Math. 20(2): 302-327 (2006) - 2005
- [c2]Jerrold R. Griggs, Xiaohua Teresa Jin:
Optimal Channel Assignments for Lattices with Conditions at Distance Two. IPDPS 2005 - 2004
- [j49]Jerrold R. Griggs, Charles E. Killian, Carla D. Savage:
Venn Diagrams and Symmetric Chain Decompositions in the Boolean Lattice. Electron. J. Comb. 11(1) (2004) - 2002
- [j48]Jerrold R. Griggs, Chih-Chang Ho:
On the half?half case of the Zarankiewicz problem. Discret. Math. 249(1-3): 95-104 (2002) - [j47]Lenore Cowen, Jerrold R. Griggs, Douglas B. West:
Foreword. Discret. Math. 257(2-3): 191-192 (2002) - [j46]Jerrold R. Griggs:
Intersecting families with minimum volume. Discret. Math. 257(2-3): 411-414 (2002) - [j45]Richard P. Anstee, Ron Ferguson, Jerrold R. Griggs:
Permutations with Low Discrepancy Consecutive k-sums. J. Comb. Theory A 100(2): 302-321 (2002) - [j44]Christian Bey, Jerrold R. Griggs:
Problem 10932. Am. Math. Mon. 109(3): 298-299 (2002) - 2001
- [j43]Jerrold R. Griggs:
Spanning subset sums for finite Abelian groups. Discret. Math. 229(1-3): 89-99 (2001) - 2000
- [j42]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, S. Louis Hakimi, Edward F. Schmeichel, J. K. Haugland, C. H. Jepson, R. Johnsonbaugh, André Kündgen, S. Levandosky, J. T. Lewis, John H. Lindsey II, O. P. Lossers, Reiner Martin, R. Morris, Gerald Myerson, José Heber Nieto, E. Rykken, J. Sorensen, J. Schlosberg, W. Seaman, J. T. Ward, Z. Zeuge:
Tiling Rectangles with Trominoes: 10641. Am. Math. Mon. 107(2): 179 (2000) - [j41]Jerrold R. Griggs, Darryl K. Nester, Sung Soo Kim:
The Asymptotics of the Birthday Problem: 10665. Am. Math. Mon. 107(7): 653-654 (2000)
1990 – 1999
- 1999
- [j40]Jerrold R. Griggs, K. B. Reid:
Landau's Theorem revisited. Australas. J Comb. 20: 19-24 (1999) - 1998
- [j39]Jerrold R. Griggs, Miklós Simonovits, George Rubin Thomas:
Extremal graphs with bounded densities of small subgraphs. J. Graph Theory 29(3): 185-207 (1998) - 1997
- [j38]Jerrold R. Griggs, Yan-Chyuan Lin:
The maximum sum of degrees above a threshold in planar graphs. Discret. Math. 169(1-3): 233-243 (1997) - [j37]Jerrold R. Griggs, Jianxin Ouyang:
(0, 1)-Matrices with No Half-Half Submatrix of Ones. Eur. J. Comb. 18(7): 751-761 (1997) - [j36]Richard P. Anstee, Jerrold R. Griggs, Attila Sali:
Small Forbidden Configurations. Graphs Comb. 13(2): 97-118 (1997) - [c1]Jerrold R. Griggs, Günter Rote:
On the distribution of sums of vectors in general position. Contemporary Trends in Discrete Mathematics 1997: 139-142 - 1996
- [j35]Jerrold R. Griggs, Owen Murphy:
Edge density and independence ratio in triangle-free graphs with maximum degree three. Discret. Math. 152(1-3): 157-170 (1996) - [j34]Richard P. Anstee, Jerrold R. Griggs:
An application of matching theory of edge-colourings. Discret. Math. 156(1-3): 253-256 (1996) - 1995
- [j33]Jerrold R. Griggs, Yan-Chyuan Lin:
Planar graphs with few vertices of small degree. Discret. Math. 143(1-3): 47-70 (1995) - [j32]Jerrold R. Griggs:
Matchings, cutsets, and chain partitions in graded posets. Discret. Math. 144(1-3): 33-46 (1995) - 1994
- [j31]Jerrold R. Griggs, Daniel J. Kleitman:
Independence and the Havel-Hakimi residue. Discret. Math. 127(1-3): 209-212 (1994) - [j30]Jerrold R. Griggs:
The Channel Assigment Problem for Mutually Adjacent Sites. J. Comb. Theory A 68(1): 169-183 (1994) - 1992
- [j29]Jerrold R. Griggs, Joan P. Hutchinson:
On the r-domination number of a graph. Discret. Math. 101(1-3): 65-72 (1992) - [j28]Jerrold R. Griggs, Mingshen Wu:
Spanning trees in graphs of minimum degree 4 or 5. Discret. Math. 104(2): 167-183 (1992) - [j27]Jerrold R. Griggs, Michelle L. Wachs:
Towers of powers and bruhat order. Eur. J. Comb. 13(5): 367-370 (1992) - [j26]Jerrold R. Griggs, Roger K. Yeh:
Labelling Graphs with a Condition at Distance 2. SIAM J. Discret. Math. 5(4): 586-595 (1992) - 1991
- [j25]Jerrold R. Griggs:
Iterated exponentials of two numbers. Discret. Math. 88(2-3): 193-209 (1991) - 1990
- [j24]Jerrold R. Griggs, Phil Hanlon, Andrew M. Odlyzko, Michael S. Waterman:
On the number of alignments of k sequences. Graphs Comb. 6(2): 133-146 (1990) - [j23]Zoltán Füredi, Jerrold R. Griggs, Ron Holzman, Daniel J. Kleitman:
Representations of families of triples over GF(2). J. Comb. Theory A 53(2): 306-315 (1990)
1980 – 1989
- 1989
- [j22]Zoltán Füredi, Jerrold R. Griggs, Daniel J. Kleitman:
A minimal cutset of the boolean lattice with almost all members. Graphs Comb. 5(1): 327-332 (1989) - [j21]Jerrold R. Griggs, James W. Walker:
Anticlusters and intersecting families of subsets. J. Comb. Theory A 51(1): 90-103 (1989) - [j20]Jerrold R. Griggs, Daniel J. Kleitman, Aditya Shastri:
Spanning trees with many leaves in cubic graphs. J. Graph Theory 13(6): 669-695 (1989) - [j19]Zoltán Füredi, Jerrold R. Griggs, Daniel J. Kleitman:
Pair Labeelings with Given Distance. SIAM J. Discret. Math. 2(4): 491-499 (1989) - 1988
- [j18]Jerrold R. Griggs, Charles M. Grinstead, David R. Guichard:
The number of maximal independent sets in a connected graph. Discret. Math. 68(2-3): 211-220 (1988) - [j17]Jerrold R. Griggs:
Problems on chain partitions. Discret. Math. 72(1-3): 157-162 (1988) - [j16]Jerrold R. Griggs:
Saturated chains of subsets and a random walk. J. Comb. Theory A 47(2): 262-283 (1988) - 1987
- [j15]Zoltán Füredi, Jerrold R. Griggs, Andrew M. Odlyzko, James B. Shearer:
Ramsey-Sperner theory. Discret. Math. 63(2-3): 143-152 (1987) - 1986
- [j14]Zoltán Füredi, Jerrold R. Griggs:
Families of finite sets with minimum shadows. Comb. 6(4): 355-363 (1986) - [j13]Jerrold R. Griggs, Andrew M. Odlyzko, James B. Shearer:
k-Color Sperner theorems. J. Comb. Theory A 42(1): 31-54 (1986) - 1985
- [j12]Jerrold R. Griggs, Andrew R. Kustin, Jeffrey A. Ross, Jürgen Stahl:
The lexicographic sum of Cohen-Macaulay and shellable ordered sets. Graphs Comb. 1(1): 145-163 (1985) - 1984
- [j11]Jerrold R. Griggs, Jürgen Stahl, William T. Trotter:
A Sperner Theorem on Unrelated Chains of Subsets. J. Comb. Theory A 36(1): 124-127 (1984) - 1983
- [j10]Jerrold R. Griggs, Jeffrey C. Lagarias, Andrew M. Odlyzko, James B. Shearer:
On the Tightest Packing of Sums of Vectors. Eur. J. Comb. 4(3): 231-236 (1983) - [j9]Jerrold R. Griggs:
Lower bounds on the independence number in terms of the degrees. J. Comb. Theory B 34(1): 22-39 (1983) - [j8]Jerrold R. Griggs:
An Upper Bound on the Ramsey Numbers R(3, k). J. Comb. Theory A 35(2): 145-153 (1983) - 1982
- [j7]Jerrold R. Griggs:
Applied combinatorics, by Alan Tucker, Wiley, New York, 1980, 385 pp. Price: $23.95. Networks 12(4): 507-508 (1982) - 1980
- [j6]Jerrold R. Griggs:
The Littlewood-Offord Problem: Tightest Packing and an M-part Sperner Theorem. Eur. J. Comb. 1(3): 225-234 (1980) - [j5]Jerrold R. Griggs:
On Chains and Sperner k-Families in Ranked Posets. J. Comb. Theory A 28(2): 156-168 (1980) - [j4]Jerrold R. Griggs:
On Chains and Sperner k-Families in Ranked Posets, II. J. Comb. Theory A 29(3): 391-394 (1980) - [j3]Jerrold R. Griggs, Douglas B. West:
Extremal Values of the Interval Number of a Graph. SIAM J. Algebraic Discret. Methods 1(1): 1-7 (1980)
1970 – 1979
- 1979
- [j2]Jerrold R. Griggs:
Extremal values of the interval number of a graph, II. Discret. Math. 28(1): 37-47 (1979) - 1977
- [j1]Jerrold R. Griggs, Daniel J. Kleitman:
A three part Sperner theorem. Discret. Math. 17(3): 281-289 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
