Erdős Problem #914 — Disjoint Cliques Under a Minimum-Degree Condition
Statement
Let satisfy and . Let be a finite simple graph with exactly vertices and minimum degree at least . Prove that there exist pairwise disjoint sets of vertices such that each is a clique of size .
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.