ProbXiv
Explorersign in
Problem archiveProblem record

Statement

What is the size of the largest homogeneous set (i.e., clique or independent set) that is guaranteed to exist in every such HnH_n?

Let rf(n)=min⁡Hnmax⁡{α(Hn),ω(Hn)}r_f(n) = \min_{H_n} \max\{\alpha(H_n), \omega(H_n)\} denote the above quantity.

\emph{Known:} From bounds on Ramsey numbers we have rf(n)≥clog⁡…log⁡⏟k−1 timesnr_f(n) \ge c \underbrace{\log \dots \log}_{k-1 \text{ times}} n.

\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) rf(n)≥clog⁡…log⁡⏟k−2 timesnr_f(n) \ge c \underbrace{\log \dots \log}_{k-2 \text{ times}} n.

If the dimension is high enough, this is sharp (i.e., in Rc(k)\mathbb{R}^{c(k)}).

\emph{Variant:} Unbalanced version Rf(k)(s,n)R_f^{(k)}(s,n), where the superscript means kk-uniform.

\textbf{Problem:} (Conlon--Fox--Pach--Sudakov--Suk) Is Rf(3)(4,n)R_f^{(3)}(4,n) polynomial in nn?

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.