Erdős Problem #568
Statement
Let be a graph such that for any tree on vertices and . Is it true that, for any with edges and no isolated vertices,
Record
- Source
- Added
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.