121 | -- | 130 | Jeremy E. Dawson, Jennifer Seberry, David B. Skillicorn. The directed packing numbers DD (t, v, v), t>=;4 |
131 | -- | 131 | György Elekes. n points in the plane can determine n :::3/2::: unit circles |
133 | -- | 140 | Konrad Engel. An Erdös - Ko- Rado theorem for the subcubes of a cube |
141 | -- | 148 | Peter Frankl, Vojtech Rödl. Families of finite sets with three intersections |
149 | -- | 159 | Peter Frankl. Hypergraphs do not jump |
161 | -- | 168 | Zoltán Füredi. Hypergraphs in which all disjoint pairs have distinct unions |
169 | -- | 179 | Frank Harary, Robert W. Robinson. Isomorphic factorizations VIII: Bisectable trees |
181 | -- | 182 | Jeff Kahn, Michael E. Saks. A polyomino with no stochastic function |
183 | -- | 185 | Henry A. Kierstead, Endre Szemerédi, William T. Trotter. On coloring graphs with locally small chromatic number |
187 | -- | 195 | James G. Oxley. On the intersections of circuits and cocircuits in matroids |
197 | -- | 206 | K. R. Parthasarathy, N. Srinivasan. Geodetic blocks of diameter three |
207 | -- | 212 | S. C. Shee, H. H. Teh. H-extensions of graphs |
213 | -- | 218 | László A. Székely. Measurable chromatic number of geometric graphs and sets without some distnaces in euclidean space |
219 | -- | 239 | Bernd Voigt. Canonization theorems for finite affine and linear spaces |
241 | -- | 245 | Alfred Weiss. Girth of bipartite sextet graphs |
247 | -- | 257 | Richard M. Wilson. The exact bound in the Erdös - Ko - Rado theorem |