Skip to content

Erdős problem 550

Start work

Let m1≤⋯≤mkm_1\leq\cdots\leq m_k and nn be sufficiently large. If TT is a tree on nn vertices and GG is the complete multipartite graph with vertex class sizes m1,…,mkm_1,\ldots,m_k, prove that R(T,G)≤(χ(G)−1)(R(T,Km1,m2)−1)+m1R(T,G)\leq (\chi(G)-1)(R(T,K_{m_1,m_2})-1)+m_1.

Nothing has been recorded here yet.

How far the record reaches2 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. FormalNone associated
  4. ResolutionNone filed
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingFormal declaration

No formal declaration is associated with this question.

A formal statement is the first thing a check can run against.

Read what the sources hold
Where the source files it318 share a topic
Graph Theory275Ramsey Theory114
None carries a Standing. Browse the topic.
Start workOpen sources