Timeline for Intersecting 4-sets
Current License: CC BY-SA 3.0
3 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Nov 6, 2012 at 7:40 | comment | added | Dima Pasechnik | indeed, an LP bound (due to Delsarte and Schrijver) should be workable for general $n$, although it's hard to guess how good it will be, without actually doing the work. | |
Nov 6, 2012 at 4:10 | history | edited | Gordon Royle | CC BY-SA 3.0 |
added 82 characters in body
|
Nov 6, 2012 at 4:03 | history | answered | Gordon Royle | CC BY-SA 3.0 |