Timeline for An upper bound for poset Ramsey number $2n \le R(Q_n,Q_n) \le n^2+2n$
Current License: CC BY-SA 3.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 28, 2016 at 4:48 | audit | Reopen votes | |||
| Oct 28, 2016 at 4:49 | |||||
| Oct 23, 2016 at 1:56 | answer | added | Martin Sleziak | timeline score: 2 | |
| Oct 23, 2016 at 1:19 | history | edited | Martin Sleziak | CC BY-SA 3.0 |
deleted 1 character in body
|
| Oct 21, 2016 at 2:37 | history | edited | Martin Sleziak | CC BY-SA 3.0 |
added 893 characters in body
|
| Oct 21, 2016 at 2:29 | history | edited | Martin Sleziak | CC BY-SA 3.0 |
added 207 characters in body; added reference
|
| Oct 21, 2016 at 2:24 | comment | added | Verse | yes, i read that paper. any explanation about the upper bound. I can not understand the proof. | |
| Oct 21, 2016 at 2:14 | comment | added | Martin Sleziak | Is it the paper Boolean lattices: Ramsey properties and embeddings? arxiv.org/abs/1512.05565 math.kit.edu/iag6/~axenovich/media/poset-15-11-15.pdf dx.doi.org/10.1007/s11083-016-9399-7 | |
| Oct 21, 2016 at 2:12 | comment | added | Martin Sleziak | Adding an exact reference and link to the paper would be useful, tooo. | |
| Oct 21, 2016 at 1:41 | comment | added | Verse | @MartinSleziak I read a paper and i can not understand for the upper bound of this inequality. $Q_n$ is a Boolean lattice of dimension $n$ | |
| Oct 21, 2016 at 1:39 | history | edited | Verse | CC BY-SA 3.0 |
added 51 characters in body
|
| Oct 20, 2016 at 14:29 | history | edited | Martin Sleziak | CC BY-SA 3.0 |
edited body
|
| Oct 20, 2016 at 14:27 | comment | added | Martin Sleziak | Simply trying Google lead me to a paper saying that: "...it is a long-standing conjecture of Burr and Erdos that $r(Q_n,Q_n) = O(2^n)$, but the best known bounds (see [10, 17]) are roughly the square of this function." | |
| Oct 20, 2016 at 14:22 | comment | added | Martin Sleziak | You should probably add what $Q_n$ is. And perhaps also where the inequality is from. (Is it just your conjecture? Is it exercise from some book?) | |
| Oct 20, 2016 at 14:21 | history | edited | Martin Sleziak | CC BY-SA 3.0 |
edited tags; more descriptive title
|
| Oct 20, 2016 at 12:50 | review | First posts | |||
| Oct 20, 2016 at 12:52 | |||||
| Oct 20, 2016 at 12:46 | history | asked | Verse | CC BY-SA 3.0 |