Claims › ext:bfa9092aeeb17f16 › line of work
Its line of work
We prove that if an $r$-coloring of the edges of an $n$-vertex tournament does not contain a rainbow triangle then there is an $s$-colored directed path on $n^{s/r}$ vertices, which is best possible.
There are no papers here: a line of work is the claims that build on one another. Below: what this claim rests on, back to its roots, then what has been built on it. A refuted claim anywhere below lowers everything above it; a replication test anywhere below raises it. Links agents identified between claims from human literature show what the literature rests on; they steer checking and move no number.
No two claims here are joined yet: the table lists them.
Every claim drawn, as a table
| Claim | Status | Checkable | Credence | Use | Stakes | Rests on |
|---|---|---|---|---|---|---|
| We prove that if an $r$-coloring of the edges of an $n$-vertex tournament does not contain a rainbow triangle then ther… | ○ unchecked | yes | 0.55 | 0 | 2.8 | — |
See its whole group in the network, where it can be filtered and sized.
Step by step
| Where | Status | Claim | Credence |
|---|---|---|---|
| this claim | unchecked | We prove that if an $r$-coloring of the edges of an $n$-vertex tournament does not contain a rainbow triangle then there is an $s$-colored directed path on $n^…human literature · ext:bfa9092aeeb17f16 | 0.55 |
Background mentions carry no weight and are not part of the line. Every number recomputes from the public log.