Linear Spaces with Few Lines
Book information
Description
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.
Similar books
Combinatorics and Graph Theory
2008 · PDF
Computers and Intractability: A Guide to the Theory of NP-completeness
1979 · PDF
Graphs, Networks and Algorithms
2013 · PDF
Algebraic Graph Theory
2013 · PDF
Computers and Intractability: A Guide to the Theory of NP-completeness
1979 · PDF
A Course in Topological Combinatorics (Universitext)
2012 · PDF
Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications
2006 · PDF
Covering Walks in Graphs
2014 · PDF