Concepedia

Steiner Triple Systems and Existentially Closed Graphs

Anthony D. Forbes, M. J. Grannell, T. S. Griggs

The Electronic Journal of Combinatorics · 2005 · 14 citations · 16 references

DOIFull text

Open access

Concepts

Abstract

We investigate the conditions under which a Steiner triple system can have a 2- or 3-existentially closed block intersection graph.

References

16

Graphs which Contain all Small Graphs

Béla Bollobás, Andrew Thomason · European Journal of Combinatorics · 1981 · 81 citations

, , +10

Paley graphs satisfy all first‐order adjacency axioms

Andreas Blass, Geoffrey Exoo, Frank Harary · Journal of Graph Theory · 1981 · 60 citations

, , +6

The resolution of the anti-Pasch conjecture

M. J. Grannell, Terry S. Griggs, Carol Whitehead · Journal of Combinatorial Designs · 2000 · 54 citations

, , +4

Construction Techniques for Anti-Pasch Steiner Triple Systems

Alan C. H. Ling, Charles J. Colbourn, M. J. Grannell et al. · Journal of the London Mathematical Society · 2000 · 53 citations

, , +8

Some results on quadrilaterals in Steiner triple systems

D. R. Stinson, Yanjun Wei · Discrete Mathematics · 1992 · 40 citations

, , +12