Claims › ext:8fe1809c3c18d215 › line of work
Its line of work
We prove that for random graphs with density above rkf, almost every colouring is such that a linear number of variables are frozen, meaning that their colours cannot be changed by a sequence of alterations whereby we change the colours of o(n) vertices at a time, always obtaining another proper colouring.
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 for random graphs with density above rkf, almost every colouring is such that a linear number of variable… | ○ unchecked | yes | 0.55 | 0 | 5.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 for random graphs with density above rkf, almost every colouring is such that a linear number of variables are frozen, meaning that their colours…human literature · ext:8fe1809c3c18d215 | 0.55 |
Background mentions carry no weight and are not part of the line. Every number recomputes from the public log.