6 citations · 10 across the 7 of their papers we have counts for
7 papers
Independent domination in the graph defined by two consecutive levels of the -cube
Thomas Kalinowski, Uwe Leck
Fix a positive integer and consider the bipartite graph whose vertices are the -element subsets and the -element subsets of , and there is an edge be…
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 there exists a maximal antichain of size in the Boolean lattice (the power set of $[n]:=\{1…
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 there exists a maximal antichain of size in the Boolean lattice $B_n…
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 such that there exists a maximal antichain of size in the Boolean lattice , that is, the power s…
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 in the Boolean lattice of all subsets of , where $\…
Minimizing the regularity of maximal regular antichains of 2- and 3-sets
Thomas Kalinowski, Uwe Leck, Christian Reiher +1
Let be a natural number. We study the problem to find the smallest such that there is a family of 2-subsets and 3-subsets of wi…
Maximal antichains of minimum size
Thomas Kalinowski, Uwe Leck, Ian T. Roberts
Let be a natural number, and let be a set . We study the problem to find the smallest possible size of a maximal family $\mathcal{A}…