Semi-algebraic Ramsey numbers
Statement
What is the size of the largest homogeneous set (i.e., clique or independent set) that is guaranteed to exist in every such ?
Let denote the above quantity.
\emph{Known:} From bounds on Ramsey numbers we have .
\textbf{Question:} (Bukh--Matou\v{s}ek) Can this be improved to a constant number of logs?
\emph{Known:} (Bukh--Matou\v{s}ek) In dimension 1, two logs suffice, and this is tight.
(Conlon--Fox--Pach--Sudakov--Suk) .
If the dimension is high enough, this is sharp (i.e., in ).
\emph{Variant:} Unbalanced version , where the superscript means -uniform.
\textbf{Problem:} (Conlon--Fox--Pach--Sudakov--Suk) Is polynomial in ?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.