Leírás
Abstract:
The poset Ramsey number $R(Q_{m},Q_{n})$ is the smallest integer $N$
such that any blue-red coloring of the elements of the Boolean lattice
$Q_{N}$ has a blue induced copy of $Q_{m}$ or
a red induced copy of $Q_{n}$. Axenovich and Walzer showed that $n+2\le
R(Q_{2},Q_{n})\le2n+2$. Recently, Lu and Thompson
improved the upper bound to $\frac{5}{3}n+2$. In this paper, we solve
this problem asymptotically by showing that $R(Q_{2},Q_{n})=n+O(n/\log n)$.
Joint work with Dániel Grósz and Abhishek Methuku.
“***The result ‘Axenovich, Walzer 2021’ mentioned in this talk should be ‘Axenovich, Winter 2021***”
You can also join the meeting in Zoom:
https://zoom.us/j/97314411772?pwd=b0kwMVRrQjY3azQ5aUk5MlF2TnRjQT09
Meeting ID: 973 1441 1772
Passcode: 473689