An Introduction to Incidence Geometry

DOI10.1007/978-3-319-43811-5zbMath1376.51001OpenAlexW2553875417MaRDI QIDQ3188099

Bart De Bruyn

Publication date: 16 August 2016

Published in: Frontiers in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-43811-5

zbMATH Keywords

designprojective spaceprojective embeddingdual polar spacedistance regular graphnear polygonpolar spacegeneralized polygonpseudo-embedding

Mathematics Subject Classification ID

Combinatorial structures in finite projective spaces (51E20) General theory of linear incidence geometry and projective geometries (51A05) Incidence structures embeddable into projective geometries (51A45) Polar geometry, symplectic spaces, orthogonal spaces (51A50) Research exposition (monographs, survey articles) pertaining to geometry (51-02)

Related Items (14)

A note on multicolor Ramsey number of small odd cycles versus a large clique ⋮ Opposition diagrams for automorphisms of large spherical buildings ⋮ Split buildings of type \(\mathsf {F}_4\) in buildings of type \(\mathsf {E}_6\) ⋮ Regular partitions of half-spin geometries ⋮ The smallest strictly Neumaier graph and its generalisations ⋮ On near polygons all whose hexes are dual polar spaces ⋮ The completion of the classification of the finite dense near \(2d\)-gons, \(d \in \{3,4\}\), with four points on each line ⋮ A note on pseudorandom Ramsey graphs ⋮ Metric dimension of dual polar graphs ⋮ Cameron-Liebler \(k\)-sets in \(\text{AG}(n,q)\) ⋮ Characterizations of the \(G_2(4)\) and \(L_3(4)\) near octagons ⋮ Cameron-Liebler line classes in \(\mathrm{AG}(3,q)\) ⋮ A generalization of the Haemers-Mathon bound for near hexagons ⋮ Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm

This page was built for publication: An Introduction to Incidence Geometry