## About this book

### Introduction

A famous theorem in the theory of linear spaces states that
every finite linear space has at least as many lines as
points. This result of De Bruijn and Erd|s led to the
conjecture that every linear space with "few lines" canbe
obtained from a projective plane by changing only a small
part of itsstructure.
Many results related to this conjecture have been proved in
the last twenty years. This monograph surveys the subject
and presents several new results, such as the recent proof
of the Dowling-Wilsonconjecture.
Typical methods used in combinatorics are developed so that
the text can be understood without too much background. Thus
the book will be of interest to anybody doing combinatorics
and can also help other readers to learn the techniques used
in this particular field.

### Keywords

Combinatorics Embeddings Finite Linear Space boundary element method character design eXist field graph graph theory proof techniques theorem

### Bibliographic information