✦ 5 frontiers

read-only vieweressays

erdős #163 · Burr-Erdős conjecture

← #162 · #164 → (packet.json; erdosproblems.com)

For any $d \geq 1$ if $H$ is a graph such that every subgraph contains a vertex of degree at most $d$ then $R (H) ≪_{d} n$ .

Worked, still open.

graph theory · solved · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

Burr-Erdős conjecture · reference

#9 in Ramsey Theory · link

Create a formalisation here · link

status

solved

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub