Selected Publications

(Updated 1 August 2021)

Extremal problems for Boolean lattices and their quotients (extended abstract),
EProceedings ALGOS 2020. (published version) (reprint)

The width of downsets,
Eur. J. Combin. 79 (2019) 46 - 59,
with D. Howard and I. Leader (published version) (reprint)

The minimum number of edges in uniform hypergraphs with Property O,
Combin. Probab. Comput. 27 (2018) 531 - 538,
with W. Kay and V. Rödl (published version) (reprint)

Maximal independent sets in the covering graph of the cube,
Discrete Appl. Math. 161(9) (2013) 1203 - 1208,
with P. Frankl and V. Rödl (published version) (reprint)

Symmetric chain decompositions of quotients of chain products by wreath products,
Electronic J. Combinatorics. 22(2) (2015) #P2.35,
with Kyle Thayer (published version) (reprint)

Convex sublattices of a lattice and a fixed point property,
Contributions to Discrete Mathematics. 8(1) (2013) 1-30,
with C. Laflamme, M. Pouzet and R. E. Woodrow (published version) (reprint)

Some quotients of chain products are symmetric chain orders,
Electronic J. Combinatorics. 19(2) (2012) #P46,
with J. McKibben-Sanders and K. Thayer (published version) (reprint)

Maximal independent sets in bipartite graphs obtained from Boolean lattices,
Europ. J. Combin. 32 (2011) 1-9,
with P. Frankl and V. Rödl (published version) (reprint)

Retracts of posets: the chain-gap property and the selection property are independent,
Algebra Universalis. 59 (2008) 243-255,
with C. Laflamme and M. Pouzet (published version) (reprint)

Splitting numbers of grids,
Electronic J. Combinatorics 12 (2005) #R17,
with B. Sands (published version) (reprint)

Some progress on the Aharoni-Korman conjecture,
Discrete Math. 250 (2002) 79-91,
with T. Goddard (published version) (reprint)

An ordered set of size ℵ ₁ with monochromatic maximal chains,
Order 17 (2000) 227-238,
with T. Goddard (published version) (reprint)

An inequality for the sizes of prime filters of finite distributive lattices,
Discrete Math. 201 (1999) 89-99,
with B. Sands (published version) (reprint)

On endomorphisms of partially ordered sets,
Combin. Probab. and Comput. 7 (1998) 33-46,
with T. Łukzak, V. Rödl, and A. Ruciński (published version) (reprint)

The complexity of the fixed point property,
Order 13 (1996) 209-218,
with T. Goddard (published version) (reprint)

A categorical version of Hedetniemi's conjecture,
Discrete Math. 152 (1996) 125-139,
with N. Sauer (published version) (reprint)

On the computational complexity of ordered subgraph recognition,
Random Structures Algorithms. 7 (1995) 223-268,
with M. Ginn and V. Rödl (published version) (reprint)

An explicit 1-factorization in the middle of the Boolean lattice,
J. Combin. Th. Ser. A. 65 (1994) 334-342,
with H. Kierstead and H. Sneavily (published version) (reprint)

Coloring ordered sets to avoid monochromatic maximal chains,
Canad. J. Math. 44 (1990) 91-103,
with V. Rödl, N. Sauer and R. Woodrow (published version) (reprint)

Fibres and ordered set coloring,
J. Combin. Th. Ser. A. 58 (1991) 158-164,
with H. Kierstead and W. T. Trotter (published version) (reprint)

Partitioning a power set into union-free classes,
Discrete Math. 88 (1991) 113-119,
with M. Aigner and D. J. Kleitman (published version) (reprint)

Maximal chains and antichains in Boolean lattices,
SIAM Journal Discrete Math. 3 (1990) 197-205,
with B. Sands and P. Winkler (published version) (reprint)