The following pages link to Jerrold R. Griggs (Q594100):
Displayed 50 items.
- On the tightest packing of sums of vectors (Q594101) (← links)
- A Sperner theorem on unrelated chains of subsets (Q594865) (← links)
- Diamond-free families (Q654889) (← links)
- An upper bound on the Ramsey numbers R(3,k) (Q787165) (← links)
- Iterated exponentials of two numbers (Q804610) (← links)
- Packing posets in the Boolean lattice. (Q890020) (← links)
- On the number of alignments of k sequences (Q912848) (← links)
- Graph labellings with variable weights, a survey (Q967309) (← links)
- The lexicographic sum of Cohen-Macaulay and shellable ordered sets (Q1062080) (← links)
- Interval graphs and maps of DNA (Q1071684) (← links)
- k-color Sperner theorems (Q1080849) (← links)
- Partitioning Boolean lattices into chains of subsets (Q1094437) (← links)
- Families of finite sets with minimum shadows (Q1100465) (← links)
- The number of maximal independent sets in a connected graph (Q1106856) (← links)
- Saturated chains of subsets and a random walk (Q1114686) (← links)
- Problems on chain partitions (Q1115891) (← links)
- On chains and Sperner k-families in ranked posets (Q1139061) (← links)
- Extremal values of the interval number of a graph. II (Q1145706) (← links)
- Extremal values of the interval number of a graph, II (Q1149452) (← links)
- On chains and Sperner k-families in ranked posets. II (Q1153108) (← links)
- The Littlewood-Offord problem: Tightest packing and an M-part Sperner theorem (Q1153155) (← links)
- Spanning trees in graphs of minimum degree 4 or 5 (Q1196990) (← links)
- On the \(r\)-domination number of a graph (Q1197015) (← links)
- Towers of powers and Bruhat order (Q1199774) (← links)
- A three part Sperner theorem (Q1236532) (← links)
- A minimal cutset of the Boolean lattice with almost all members (Q1262863) (← links)
- Minimum cutsets for an element of a Boolean lattice (Q1264164) (← links)
- The cycling of partitions and composition under repeated shifts (Q1271859) (← links)
- Independence and the Havel-Hakimi residue (Q1322229) (← links)
- The channel assignment problem for mutually adjacent sites (Q1336445) (← links)
- Applications of the symmetric chain decomposition of the lattice of divisors (Q1337572) (← links)
- The maximum sum of degrees above a threshold in planar graphs (Q1357746) (← links)
- Small forbidden configurations (Q1359370) (← links)
- (Q1422138) (redirect page) (← links)
- Venn diagrams and symmetric chain decompositions in the Boolean lattice (Q1422140) (← links)
- On the half-half case of the Zarankiewicz problem (Q1598845) (← links)
- Representations of families of triples over \(GF(2)\) (Q1812889) (← links)
- Ramsey-Sperner theory (Q1821793) (← links)
- Lower bounds on the independence number in terms of the degrees (Q1835927) (← links)
- Intersecting families with minimum volume (Q1850022) (← links)
- Permutations with low discrepancy consecutive \(k\)-sums (Q1865398) (← links)
- Planar graphs with few vertices of small degree (Q1897428) (← links)
- Matchings, cutsets, and chain partitions in graded posets (Q1898341) (← links)
- Edge density and independence ratio in triangle-free graphs with maximum degree three (Q1917491) (← links)
- An application of matching theory of edge-colourings (Q1923520) (← links)
- The partition method for poset-free families (Q1956245) (← links)
- Maximum antichains in the product of chains (Q2266031) (← links)
- Poset-free families and Lubell-boundedness (Q2347975) (← links)
- No four subsets forming an \(N\) (Q2427561) (← links)
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions (Q2471056) (← links)