ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let VV be a finite vertex set, let GG be a simple graph on VV, and write n=∣V∣n=|V|. For r∈{1,…,n}r\in\{1,\ldots,n\}, let tr(n)t_r(n) be the number of edges in the Turán graph T(n,r)T(n,r). If GG has at least tr(n)t_r(n) edges, prove that there exists a clique {x1,…,xr}\{x_1,\ldots,x_r\} in GG such that

2r∣E(G)∣n≤d(x1)+⋯+d(xr),\frac{2r|E(G)|}{n}\le d(x_1)+\cdots+d(x_r),

where d(x)d(x) denotes the degree of xx in GG.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.