For every integer n\geq 1, does every graph of minimum degree at least n contain an immersion of the complete graph K_n?
Statement
For every integer n\geq 1, does every graph of minimum degree at least n contain an immersion of the complete graph K_n?
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.