Timeline for Upper bound on number of lines in a linear space given degree bounds
Current License: CC BY-SA 2.5
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 18, 2010 at 14:28 | history | edited | Peter Nelson | CC BY-SA 2.5 |
added 38 characters in body; deleted 2 characters in body
|
| Aug 17, 2010 at 13:50 | answer | added | Andreas Blass | timeline score: 2 | |
| Aug 17, 2010 at 10:21 | comment | added | Hugo van der Sanden | Oops, I misread it, my apologies. | |
| Aug 17, 2010 at 9:36 | comment | added | Klaus Draeger | For $n > q+2$, that would violate the first condition (since every point would lie on $n-1 > q+1$ lines) | |
| Aug 17, 2010 at 9:02 | comment | added | Hugo van der Sanden | I see nothing in the definition to disallow for any q the case of each line consisting of just 2 points. Then given n points there are $C(n,2)-(n-1)$ lines not containing a given point, and you can always take n large enough to make this exceed $q^2$. What am I missing? | |
| Aug 16, 2010 at 21:11 | history | edited | Peter Nelson | CC BY-SA 2.5 |
added 59 characters in body
|
| Aug 16, 2010 at 20:53 | comment | added | Felipe Voloch | What is the question? | |
| Aug 16, 2010 at 19:35 | history | asked | Peter Nelson | CC BY-SA 2.5 |