Book contents
- Frontmatter
- Contents
- Preface
- Papers contributed by the participants
- Perfect codes and distance-transitive graphs
- Generalisation of Fisher's inequality to fields with more than one element
- On balanced arrays
- Positions in Room squares
- Analogues of Heawood's theorem
- Cut-set lattices of graphs
- On the chromatic index of a graph, II.
- On a theorem of R. A. Liebler
- Outerthickness and outercoarseness of graphs
- Graphs with homeomorphically irreducible spanning trees
- A note on embedding latin rectangles
- Some results in semi-stable graphs
- Hereditary properties and P-chromatic numbers
- Some problems concerning complete latin squares
- Necklace enumeration with adjacency restrictions
- On a family of planar bicritical graphs
- On the enumeration of partially ordered sets of integers
- The distance between nodes in recursive trees
- Partition relations
- On a problem of Daykin concerning intersecting families of sets
- Unstable trees
- Distance-transitive graphs
- Enumeration of graphs on a large periodic lattice
- Some polynomials associated with graphs
- Equidistant point sets
- Eigenvalues of graphs and operations
- Graph theory and algebraic topology
- Applications of polymatroids and linear programming to transversals and graphs
- Problem section
On a theorem of R. A. Liebler
Published online by Cambridge University Press: 05 April 2013
- Frontmatter
- Contents
- Preface
- Papers contributed by the participants
- Perfect codes and distance-transitive graphs
- Generalisation of Fisher's inequality to fields with more than one element
- On balanced arrays
- Positions in Room squares
- Analogues of Heawood's theorem
- Cut-set lattices of graphs
- On the chromatic index of a graph, II.
- On a theorem of R. A. Liebler
- Outerthickness and outercoarseness of graphs
- Graphs with homeomorphically irreducible spanning trees
- A note on embedding latin rectangles
- Some results in semi-stable graphs
- Hereditary properties and P-chromatic numbers
- Some problems concerning complete latin squares
- Necklace enumeration with adjacency restrictions
- On a family of planar bicritical graphs
- On the enumeration of partially ordered sets of integers
- The distance between nodes in recursive trees
- Partition relations
- On a problem of Daykin concerning intersecting families of sets
- Unstable trees
- Distance-transitive graphs
- Enumeration of graphs on a large periodic lattice
- Some polynomials associated with graphs
- Equidistant point sets
- Eigenvalues of graphs and operations
- Graph theory and algebraic topology
- Applications of polymatroids and linear programming to transversals and graphs
- Problem section
Summary
The conjecture that ‘any affine plane A admitting a collineation group which is rank 3 on points is a translation plane’ was stated by D. G. Higman [3]; M. J. Kallaher [4] proved a slightly weaker statement namely that A is either a translation plane or the dual of a translation plane, and R. A. Liebler [5] overcame the possible ambiguity to prove the conjecture. We offer a proof which, though similar to [4] and [5] in the first stages, completes the final steps more smoothly. Thus we prove
Theorem (Liebler). An affine plane A admitting a collineation group H which is rank 3 on points is a translation plane, (and H contains all translations).
Let A be an affine plane of order k, with projective completion P having line at infinity l(∞). P(∞), P(l), …, P(k) are the points of l(∞) and l(l), …, l(k) the affine lines through P(∞). For a point P and line l of P, (P) denotes the set of lines through P and (l) the set of points on l. If G is a group acting on the set Ω, then GΩ is the natural permutation group induced by G on Ω.
- Type
- Chapter
- Information
- Combinatorics , pp. 53 - 56Publisher: Cambridge University PressPrint publication year: 1974