44 citations · 263 across the 29 of their papers we have counts for
30 papers
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…
Convex Hulls for Graphs of Quadratic Functions With Unit Coefficients: Even Wheels and Complete Split Graphs
Mitchell Harris, Thomas Kalinowski
We study the convex hull of the graph of a quadratic function , where the sum is over the edge set of a graph with vertex set $\{1,\dots,n\}…
Maintenance scheduling in a railway corricdor
Saman Eskandarzadeh, Thomas Kalinowski, Hamish Waterer
We investigate a novel scheduling problem which is motivated by an application in the Australian railway industry. Given a set of maintenance jobs and a set of train paths over a r…
Feasible bases for a polytope related to the Hamilton cycle problem
Thomas Kalinowski, Sogol Mohammadian
We study a certain polytope depending on a graph and a parameter which arises from embedding the Hamiltonian cycle problem in a discounted Markov decision process.…