Jerrold R. Griggs

activity

19932023

most citedSupersaturation in the Boolean lattice

17 citations · 31 across the 11 of their papers we have counts for

collaborators

11 papers

math.CO2023★ 1 cited

Sizes of flat maximal antichains of subsets

Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck +2

This is the second of two papers investigating for which positive integers $m$ there exists a maximal antichain of size $m$ in the Boolean lattice $B_{n}$ (the power set of $[n]:=\{1…

math.CO2021★ 1 cited

Maximal antichains of subsets II: Constructions

Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck +2

This is the second in a sequence of three papers investigating the question for which positive integers $m$ there exists a maximal antichain of size $m$ in the Boolean lattice $B_n…

math.CO2021★ 6 cited

The saturation spectrum for antichains of subsets

Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck +2

Extending a classical theorem of Sperner, we characterize the integers $m$ such that there exists a maximal antichain of size $m$ in the Boolean lattice $B_{n}$ , that is, the power s…

math.CO2019

Spanning Trees and Domination in Hypercubes

Jerrold R. Griggs

Let $L (G)$ denote the maximum number of leaves in any spanning tree of a connected graph $G$ . We show the (known) result that for the $n$ -cube $Q_{n}$ , $L (Q_{n}) \sim 2^{n} = ∣ V (Q_{n}) ∣$ a…

math.CO2017★ 2 cited

Minimum Weight Flat Antichains of Subsets

Jerrold R. Griggs, Sven Hartmann, Thomas Kalinowski +2

Building on classical theorems of Sperner and Kruskal-Katona, we investigate antichains $F$ in the Boolean lattice $B_{n}$ of all subsets of $[n] := {1, 2, \dots, n}$ , where $\…

math.CO2013

Packing Posets in the Boolean Lattice

Andrew P. Dove, Jerrold R. Griggs

We are interested in maximizing the number of pairwise unrelated copies of a poset $P$ in the family of all subsets of $[n]$ . We prove that for any $P$ the maximum number of unrela…