The conjectured exact value of the Ramsey parameter f(k)

Let $f(k)$ be the Ramsey parameter defined in the source: the minimum parameter governing the relevant dependency-digraph Ramsey problem, and let $g(k)$ be the corresponding ordered-graph parameter. The exact-value conjecture for $f(k)$.

$$f(k)=\left\lfloor\frac{k^2}{4}\right\rfloor+1.$$

The source notes that this would imply the optimal equality $g(k)=f(k)=\left\lfloor\frac{k^2}{4}\right\rfloor+1$, and reports computer verification for $k\le 6$; the conjecture is otherwise unresolved.