Erdős Problem #904 — Degree Sums in Large Cliques
Statement
Let be a finite vertex set, let be a simple graph on , and write . For , let be the number of edges in the Turán graph . If has at least edges, prove that there exists a clique in such that
where denotes the degree of in .
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.