Book contents
- Frontmatter
- Contents
- PREFACE
- Introduction
- Generalized Steiner systems of type 3-(v, {4,6}, 1)
- Some remarks on D.R. Hughes' construction of M12 and its associated designs
- On k-sets of class [0,1,2,n]2 in PG(r,q)
- Covering graphs and symmetric designs
- Arcs and blocking sets
- Flat embeddings of near 2n-gons
- Codes, caps and linear spaces
- Geometries originating from certain distance-regular graphs
- Transitive automorphism groups of finite quasifields
- On k-sets of type (m,n) in projective planes of square order
- On k-sets of type (m,n) in a Steiner system S(2, l, v)
- Some translation planes of order 81
- A new partial geometry constructed from the Hoffman-Singleton graph
- Locally cotriangular graphs
- Coding theory of designs
- On shears in fixed-point-free affine groups
- On (k,n)-arcs and the falsity of the Lunelli-Sce conjecture
- Cubic surfaces whose points all lie on their 27 lines
- Existence results for translation nets
- Translation planes having PSL(2,w) or SL(3,w) as a collineation group
- Sequenceable groups: a survey
- Polar spaces embedded in a projective space
- On relations among the projective geometry codes
- Partition loops and affine geometries
- Regular cliques in graphs and special 1½ designs
- Bericht über Hecke Algebren und Coxeter Algebren eindlicher Geometrien
- On buildings and locally finite Tits geometries
- Moufang conditions for finite generalized quadrangles
- Embedding geometric lattices in a projective space
- Coverings of certain finite geometries
- On class-regular projective Hjelmslev planes
- On multiplicity-free permutation representations
- On a characterization of the Grassmann manifold representing the lines in a projective space
- Affine subplanes of projective planes
- Point stable designs
- Other talks
- Participants
Locally cotriangular graphs
Published online by Cambridge University Press: 05 April 2013
- Frontmatter
- Contents
- PREFACE
- Introduction
- Generalized Steiner systems of type 3-(v, {4,6}, 1)
- Some remarks on D.R. Hughes' construction of M12 and its associated designs
- On k-sets of class [0,1,2,n]2 in PG(r,q)
- Covering graphs and symmetric designs
- Arcs and blocking sets
- Flat embeddings of near 2n-gons
- Codes, caps and linear spaces
- Geometries originating from certain distance-regular graphs
- Transitive automorphism groups of finite quasifields
- On k-sets of type (m,n) in projective planes of square order
- On k-sets of type (m,n) in a Steiner system S(2, l, v)
- Some translation planes of order 81
- A new partial geometry constructed from the Hoffman-Singleton graph
- Locally cotriangular graphs
- Coding theory of designs
- On shears in fixed-point-free affine groups
- On (k,n)-arcs and the falsity of the Lunelli-Sce conjecture
- Cubic surfaces whose points all lie on their 27 lines
- Existence results for translation nets
- Translation planes having PSL(2,w) or SL(3,w) as a collineation group
- Sequenceable groups: a survey
- Polar spaces embedded in a projective space
- On relations among the projective geometry codes
- Partition loops and affine geometries
- Regular cliques in graphs and special 1½ designs
- Bericht über Hecke Algebren und Coxeter Algebren eindlicher Geometrien
- On buildings and locally finite Tits geometries
- Moufang conditions for finite generalized quadrangles
- Embedding geometric lattices in a projective space
- Coverings of certain finite geometries
- On class-regular projective Hjelmslev planes
- On multiplicity-free permutation representations
- On a characterization of the Grassmann manifold representing the lines in a projective space
- Affine subplanes of projective planes
- Point stable designs
- Other talks
- Participants
Summary
A graph G is said to be locally X, where X is any collection of graphs if, for each vertex x in G, the subgraph (x) of all vertices of G adjacent to x is isomorphic to some member of X. In the case that X consists of a single graph X, we say G is locally X instead of locally {X}.
A graph G is said to possess the cotriangle property if for every pair (x, y) of non-adjacent vertices in G there exists a third vertex z forming a subgraph T = {x, y, z} isomorphic to K3 (that is, a “cotriangle”) having the property that any vertex u of G not lying in the cotriangle T is adjacent to exactly one or all of the vertices of T.
We write G = A + B, if A and B are disjoint subgraphs of G the union of whose vertices comprise the vertices of G, and if every vertex in A is adjacent to every vertex in B. Such a graph G possesses the cotriangle property if and only if both A and B do. We say G is indecomposable if it admits no such decomposition G = A + B into non-empty subgraphs A and B.
- Type
- Chapter
- Information
- Finite Geometries and DesignsProceedings of the Second Isle of Thorns Conference 1980, pp. 128 - 133Publisher: Cambridge University PressPrint publication year: 1981
- 1
- Cited by