| On some applications of graph theory, I | 5 | 21.51 | 2006 |
| Extremal graphs for intersecting triangles | 13 | 1.48 | 1995 |
| Coloring Prime Distance Graphs | 22 | 2.17 | 1990 |
| Maximal antiramsey graphs and the strong chromatic number | 6 | 0.69 | 1989 |
| On the number of partitions of n without a given subsum (I) | 0 | 0.34 | 1989 |
| On the number of distinct induced subgraphs of a graph | 10 | 1.75 | 1989 |
| Radius, diameter, and minimum degree | 38 | 4.49 | 1989 |
| Goodness of trees for generalized books | 8 | 1.98 | 1987 |
| A Ramsey problem of Harary on graphs with prescribed size | 9 | 1.78 | 1987 |
| Extremal Problems On Permutations Under Cyclic Equivalence | 1 | 0.39 | 1987 |
| Two problems in extremal graph theory | 0 | 0.34 | 1986 |
| The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent | 42 | 7.23 | 1986 |
| Coloring graphs with locally few colors | 27 | 2.39 | 1986 |
| Multipartite graph-sparse gra^j Ramsey numbers | 9 | 1.60 | 1985 |
| Extremal subgraphs for two graphs | 1 | 0.41 | 1985 |
| Dual integer linear programs and the relationship between their optima | 4 | 10.78 | 1985 |
| On 2-designs | 35 | 13.25 | 1985 |
| Colouring the real line | 52 | 5.56 | 1985 |
| Quantitative forms of a theorem of hilbert | 6 | 0.89 | 1985 |
| Addendum to “trees in random graphs” | 2 | 0.71 | 1984 |
| Enumeration of intersecting families | 6 | 1.25 | 1984 |
| Finite linear spaces and projective planes | 10 | 8.21 | 1983 |
| Trees in random graphs | 11 | 3.30 | 1983 |
| Graphs with certain families of spanning trees | 3 | 0.52 | 1982 |
| Minimal decompositions of hypergraphs into mutually isomorphic subhypergraphs | 3 | 0.56 | 1982 |
| Ramsey-minimal graphs for forests | 9 | 1.66 | 1982 |
| Ramsey-minimal graphs for star-forests | 8 | 2.16 | 1981 |
| On a problem of L. Fejes Tóth | 2 | 0.40 | 1980 |
| Some combinatorial problems in the plane | 6 | 0.92 | 1978 |
| On cycle - Complete graph ramsey numbers. | 27 | 3.47 | 1978 |
| Combinatorial properties of systems of sets | 16 | 15.42 | 1978 |
| On a problem in extremal graph theory | 1 | 0.37 | 1977 |
| Total Matching Numbers And Total Covering Numbers Of Complementary Graphs | 7 | 0.60 | 1977 |
| Partition theorems for subsets of vector spaces | 4 | 2.41 | 1975 |
| Remark on a theorem of Lindström | 0 | 0.34 | 1974 |
| On the connection between chromatic number, maximal clique and minimal degree of a graph | 56 | 13.16 | 1974 |
| On a valence problem in extremal graph theory | 35 | 6.73 | 1973 |
| On a combinatorial game | 102 | 39.09 | 1973 |
| Euclidean ramsey theorems. I | 30 | 10.56 | 1973 |
