1. F. G. Abramson and L. A. Harrington, Models without indiscernibles, J. Symbolic Logic
43 (1978), no. 3, 572–600.
2. N. Alon and A. Shapira, On an extremal problem of Brown, Erdős and Sós, Combinatorica, to appear.
3. C. Avart, V. Rödl, and M. Schacht, Every monotone 3-graph property is testable, submitted.
4. B. Bollobás and A. Thomason, Projections of bodies and hereditary properties of hypergraphs, Bull. London Math. Soc.
27 (1995), no. 5, 417–424.
5. B. Bollobás and A. Thomason, Hereditary and monotone properties of graphs, The mathematics of Paul Erdős, II, Algorithms Gombin., vol. 14, Springer, Berlin, 1997, pp. 70–78.