ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let r3↔(H)\overleftrightarrow{r_3}(H) be the three-color directed Ramsey number, and let an acyclic digraph have maximum degree at most Δ\Delta. Three-color directed-Ramsey conjecture. There is an absolute constant Δ\Delta and an infinite sequence {Hn}\{H_n\} of nn-vertex acyclic digraphs, each with maximum degree at most Δ\Delta, such that

r3↔(Hn)≥nω(1).\overleftrightarrow{r_3}(H_n)\geq n^{\omega(1)}.

The paper notes super-polynomial constructions for some other numbers of colors but identifies the three-color case as an unresolved intermediate case.

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.