Timeline for Is there a "Bipartite" Szemeredi-Trotter theorem?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 19, 2014 at 18:21 | vote | accept | Rob F | ||
| Aug 18, 2014 at 8:00 | answer | added | domotorp | timeline score: 0 | |
| Aug 12, 2014 at 20:04 | comment | added | Nate | When $k >> L^{1/2}$ this version of the Szemeredi-Trotter theorem tells us that the best you can do, up to a constant factor, is partition the lines into $L/k$ sets of size $k$ and have all the lines each part coincide at a point. Seems to me that if we are in this range we could just put all these intersection points on a single red line, so in this range $B/k$ should still be optimal. | |
| Aug 12, 2014 at 19:37 | review | First posts | |||
| Aug 12, 2014 at 20:05 | |||||
| Aug 12, 2014 at 19:36 | history | asked | Rob F | CC BY-SA 3.0 |