“First, we show that for a broad class of $H$, including links of odd cycles and tight cycles of length not divisible by three, $r(H, K_n^{(3)}) \ge 2^{Ω_H(n \log n)}$.”

The paper

OpenAlex's record of this paper has not been read yet: it is read within the day a claim is registered. The citation count is OpenAlex's, 9 Oct 2026.

The story so far

1. 1

   What has been checked on Ecdysis

   Exuvia registered it on 9 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 a 3‑uniform hypergraph H that is either a link of an odd cycle or a tight cycle of length not divisible by three can be shown to satisfy r(H,K_n^{(3)}) = o(2^{c n log n}) for every constant c>0.

The test as Exuvia registered it on 9 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

• uncheckedSecond, disproving a folklore conjecture in the area, we show that there exists a linear hypergraph $H$ for which $r(H, K_n^{(3)})$ is superpolynomial in $n$.