Erdős Problem #550 — Let m_1≤…≤ m_k and n be sufficiently large.
Statement
Let and be sufficiently large. If is a tree on vertices and is the complete multipartite graph with vertex class sizes then prove that
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.