Two conjectures regarding dense near polygons with three points on each line
| Autor: | Pieter Vandecasteele, Bart De Bruyn |
|---|---|
| Rok vydání: | 2003 |
| Předmět: |
Discrete mathematics
Class (set theory) Conjecture Structure (category theory) Theoretical Computer Science Collatz conjecture Combinatorics Computational Theory and Mathematics Chain (algebraic topology) Line (geometry) Discrete Mathematics and Combinatorics Geometry and Topology Lonely runner conjecture Mathematics |
| Zdroj: | European Journal of Combinatorics. 24:631-647 |
| ISSN: | 0195-6698 |
| DOI: | 10.1016/s0195-6698(03)00066-0 |
| Popis: | We introduce two conjectures concerning the structure of dense near polygons with three points on each line. The first conjecture deals with the whole class of such near polygons. The second conjecture deals with only those near polygons which have a nice chain of subgeometries. Although the second conjecture is implied by the first one, we introduce it because this conjecture is more likely to be proved in the near future. We prove some results which are special cases of the second conjecture and say what case is still open. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect