Premium
Bounding the size of near hexagons with lines of size 3
Author(s) -
De Bruyn Bart
Publication year - 2006
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20153
Subject(s) - bounding overwatch , mathematics , combinatorics , point (geometry) , graph , discrete mathematics , geometry , computer science , artificial intelligence
We consider finite near hexagons with lines of size 3, and prove that there are only finitely many examples given the nondegeneracy condition that for each point there exists a point at distance 3 to it. © 2006 Wiley Periodicals, Inc. J Graph Theory 52: 108–122, 2006