79 research outputs found
Pairwise transitive 2-designs
We classify the pairwise transitive 2-designs, that is, 2-designs such that a
group of automorphisms is transitive on the following five sets of ordered
pairs: point-pairs, incident point-block pairs, non-incident point-block pairs,
intersecting block-pairs and non-intersecting block-pairs. These 2-designs fall
into two classes: the symmetric ones and the quasisymmetric ones. The symmetric
examples include the symmetric designs from projective geometry, the 11-point
biplane, the Higman-Sims design, and designs of points and quadratic forms on
symplectic spaces. The quasisymmetric examples arise from affine geometry and
the point-line geometry of projective spaces, as well as several sporadic
examples.Comment: 28 pages, updated after review proces
Codistances of 3-spherical buildings
We show that a 3-spherical building in which each rank 2 residue is connected
far away from a chamber, and each rank 3 residue is simply 2-connected far away
from a chamber, admits a twinning (i.e., is one half of a twin building) as
soon as it admits a codistance, i.e., a twinning with a single chamber.Comment: 35 pages; revised after a referee's comment
Automorphisms and opposition in twin buildings
We show that every automorphism of a thick twin building interchanging the
halves of the building maps some residue to an opposite one. Furthermore we
show that no automorphism of a locally finite 2-spherical twin building of rank
at least 3 maps every residue of one fixed type to an opposite. The main
ingredient of the proof is a lemma that states that every duality of a thick
finite projective plane admits an absolute point, i.e., a point mapped onto an
incident line. Our results also hold for all finite irreducible spherical
buildings of rank at least 3, and as a consequence we deduce that every
involution of a thick irreducible finite spherical building of rank at least 3
has a fixed residue
Symmetry properties of subdivision graphs
The subdivision graph of a graph is obtained from
by `adding a vertex' in the middle of every edge of \Si. Various
symmetry properties of are studied. We prove that, for a connected
graph , is locally -arc transitive if and only if
is -arc transitive. The diameter of
is , where has diameter and , and local -distance transitivity of is
defined for . In the general case where
we prove that is locally -distance transitive
if and only if is -arc transitive. For the
remaining values of , namely , we classify
the graphs for which is locally -distance transitive in
the cases, and . The cases remain open
Line graphs and -geodesic transitivity
For a graph , a positive integer and a subgroup G\leq
\Aut(\Gamma), we prove that is transitive on the set of -arcs of
if and only if has girth at least and is
transitive on the set of -geodesics of its line graph. As applications,
we first prove that the only non-complete locally cyclic -geodesic
transitive graphs are the complete multipartite graph and the
icosahedron. Secondly we classify 2-geodesic transitive graphs of valency 4 and
girth 3, and determine which of them are geodesic transitive
- …