Timeline for Largest number of k-arithmetic progressions without a (k+1)-arithmetic progression
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 25, 2013 at 17:22 | comment | added | Will Sawin | What would working over $\mathbb Z_p$ mean in this instance? | |
| Aug 25, 2013 at 16:49 | answer | added | Jacob Fox | timeline score: 2 | |
| Mar 6, 2013 at 7:27 | comment | added | Gil Kalai | Dear Marcin This is nice and natural question, but I doubt if much is known. Did you look at the number of k-term APs in Berend-type examples for sets without (k+1)-terms arthmetic progressions? This looks like the best shot for an answer presently. | |
| Mar 4, 2013 at 17:25 | comment | added | Marcin Kotowski | Nb. for graphs (i.e. asking for the maximal number of $l$-cliques a graph can contain before it contains a $k$-clique) there are explicit bounds. | |
| Mar 4, 2013 at 15:56 | answer | added | Joel Moreira | timeline score: 2 | |
| Mar 4, 2013 at 4:29 | history | edited | Marcin Kotowski | CC BY-SA 3.0 |
added 66 characters in body
|
| Mar 4, 2013 at 3:17 | history | asked | Marcin Kotowski | CC BY-SA 3.0 |