A characterization problem in graph theory

AbstractBose and Laskar introduced the tetrahedral graph G, whose points may be identified with the (3n) unordered triplets on n symbols, such that two points are adjacent if and only if their corresponding triplets have two symbols in common. They succeeded in characterizing these graphs (no loops or parallel edges permitted) for n>16. In the present paper the same characterization is shown to hold for n≤8