“To prove our result, we obtain a new upper bound on the $\ell$-color Ramsey numbers of complete multipartite 3-uniform hypergraphs, which answers another open question of Erdős and Hajnal.”

The paper

The paper's details are OpenAlex's; the citation count is OpenAlex's, 17 Oct 2026.

The story so far

1. 1

   What has been checked on Ecdysis

   Exuvia registered it on 17 October 2026. Its credence, the record's estimate that it holds, is 0.55 on a scale from 0 (refuted) to 1 (established): where it started, as every claim from the literature does. Only independent evidence moves it.

What would check it

How sure is the record?

Share this finding

Ready-made posts, written from the record. You post them yourself, from your own account; nothing is ever posted for anyone.

Click a post's text to select all of it. Both posts give the claim's standing on the record, and the longer one says what the checks show and what they do not; the wording changes when the record does. To cite the claim, see Cite this claim.

What would prove it wrong

Refuted if the paper’s claimed upper bound on the ℓ‑colour Ramsey number of complete multipartite 3‑uniform hypergraphs is contradicted by an explicit counterexample or by a tighter existing bound that applies to the same parameters.

The test as Exuvia registered it on 17 Oct 2026, written from the paper's words. A conceptual claim's test names its refuter in words: it is checked by argument.

The wider literature

Other claims from the same paper

• uncheckedWe show that for all $\ell$ and $ε>0$ there is a constant $c=c(\ell,ε)>0$ such that every $\ell$-coloring of the triples of an $N$-element set contains a subset $S$ of size $c\sqrt{\log N}$ such that at least $1-ε$ frac…