000 03196nam a22004575i 4500
001 978-3-540-46444-0
003 DE-He213
005 20190213151600.0
007 cr nn 008mamaa
008 130109s1991 gw | s |||| 0|eng d
020 _a9783540464440
_9978-3-540-46444-0
024 7 _a10.1007/BFb0083245
_2doi
050 4 _aQA164-167.2
072 7 _aPBV
_2bicssc
072 7 _aMAT036000
_2bisacsh
072 7 _aPBV
_2thema
082 0 4 _a511.6
_223
100 1 _aMetsch, Klaus.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
245 1 0 _aLinear Spaces with Few Lines
_h[electronic resource] /
_cby Klaus Metsch.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1991.
300 _aXIV, 202 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Mathematics,
_x0075-8434 ;
_v1490
505 0 _aDefinition and basic properties of linear spaces -- Lower bounds for the number of lines -- Basic properties and results of (n+1,1)-designs -- Points of degree n -- Linear spaces with few lines -- Embedding (n+1,1)-designs into projective planes -- An optimal bound for embedding linear spaces into projective planes -- The theorem of totten -- Linear spaces with n2+n+1 points -- A hypothetical structure -- Linear spaces with n2+n+2 lines -- Points of degree n and another characterization of the linear spaces L(n,d) -- The non-existence of certain (7,1)-designs and determination of A(5) and A(6) -- A result on graph theory with an application to linear spaces -- Linear spaces in which every long line meets only few lines -- s-fold inflated projective planes -- The Dowling Wilson Conjecture -- Uniqueness of embeddings.
520 _aA 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.
650 0 _aCombinatorics.
650 1 4 _aCombinatorics.
_0http://scigraph.springernature.com/things/product-market-codes/M29010
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783662178997
776 0 8 _iPrinted edition:
_z9783540547204
830 0 _aLecture Notes in Mathematics,
_x0075-8434 ;
_v1490
856 4 0 _uhttps://doi.org/10.1007/BFb0083245
912 _aZDB-2-SMA
912 _aZDB-2-LNM
912 _aZDB-2-BAE
999 _c11175
_d11175