| Full and maximal squashed flat antichains of minimum weight. | 0 | 0.34 | 2017 |
| Packing Posets in the Boolean Lattice | 1 | 0.38 | 2015 |
| Poset-free Families and Lubell-boundedness | 5 | 0.44 | 2015 |
| Supersaturation in the Boolean lattice | 6 | 0.54 | 2013 |
| The partition method for poset-free families. | 5 | 0.47 | 2013 |
| Diamond-free families | 17 | 1.21 | 2012 |
| On families of subsets with a forbidden subposet | 23 | 1.76 | 2009 |
| Graph labellings with variable weights, a survey | 14 | 0.72 | 2009 |
| No four subsets forming an N | 18 | 2.02 | 2008 |
| Note: No four subsets forming an N | 8 | 1.11 | 2008 |
| Real Number Channel Assignments for Lattices | 8 | 0.58 | 2008 |
| Recent progress in mathematics and engineering on optimal graph labellings with distance conditions | 18 | 0.81 | 2007 |
| Real Number Labelings For Paths And Cycles | 4 | 0.42 | 2007 |
| Real Number Graph Labellings with Distance Conditions | 17 | 0.95 | 2006 |
| Optimal Channel Assignments for Lattices with Conditions at Distance Two | 11 | 0.65 | 2005 |
| Venn Diagrams and Symmetric Chain Decompositions in the Boolean Lattice | 19 | 2.08 | 2004 |
| Intersecting families with minimum volume | 0 | 0.34 | 2002 |
| On the half-half case of the Zarankiewicz problem | 3 | 0.51 | 2002 |
| Permutations with low discrepancy consecutive k-sums | 1 | 0.60 | 2002 |
| Tiling Rectangles with Trominoes: 10641. | 0 | 0.34 | 2000 |
| The Asymptotics of the Birthday Problem: 10665. | 0 | 0.34 | 2000 |
| Landau's Theorem revisited. | 0 | 0.34 | 1999 |
| Extremal graphs with bounded densities of small subgraphs | 8 | 1.11 | 1998 |
| On the Distribution of Sums of Vectors in General Position | 2 | 1.09 | 1997 |
| The maximum sum of degrees above a threshold in planar graphs | 0 | 0.34 | 1997 |
| (0,1)-matrices with no half-half submatrix of ones | 7 | 1.07 | 1997 |
| Small Forbidden Configurations. | 12 | 1.00 | 1997 |
| Edge density and independence ratio in triangle-free graphs with maximum degree three | 7 | 2.83 | 1996 |
| An application of matching theory of edge-colourings | 4 | 0.44 | 1996 |
| Matchings, cutsets, and chain partitions in graded posets | 17 | 1.82 | 1995 |
| Planar graphs with few vertices of small degree | 1 | 0.48 | 1995 |
| Independence and the Havel-Hakimi residue | 14 | 1.13 | 1994 |
| The channel assignment problem for mutually adjacent sites | 17 | 2.24 | 1994 |
| Spanning trees in graphs of minimum degree 4 or 5 | 26 | 1.42 | 1992 |
| Towers of powers and bruhat order. | 0 | 0.34 | 1992 |
| On the r-domination number of a graph | 1 | 0.43 | 1992 |
| Labelling graphs with a condition at distance 2 | 318 | 25.30 | 1992 |
| Iterated exponentials of two numbers | 1 | 0.48 | 1991 |
| Representations of families of triples over GF(2) | 2 | 0.51 | 1990 |
| Spanning trees with many leaves in cubic graphs | 25 | 6.53 | 1989 |
| Saturated chains of subsets and a random walk | 3 | 0.93 | 1988 |
| The number of maximal independent sets in a connected graph | 32 | 3.97 | 1988 |
| k-Color Sperner theorems | 4 | 1.82 | 1986 |
| The lexicographic sum of Cohen-Macaulay and shellable ordered sets. | 0 | 0.34 | 1985 |
| A Sperner theorem on unrelated chains of subsets | 10 | 2.34 | 1984 |
| Lower bounds on the independence number in terms of the degrees | 41 | 19.23 | 1983 |
| An upper bound on the Ramsey numbers R(3, k) | 9 | 6.08 | 1983 |
| Applied combinatorics, by Alan Tucker, Wiley, New York, 1980,385 pp. Price: $23.95 | 0 | 0.34 | 1982 |
| The Littlewood-Offord Problem: Tightest Packing and an M-part Sperner Theorem | 5 | 3.16 | 1980 |
| Extremal Values of the Interval Number of a Graph | 47 | 12.04 | 1980 |
