ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let r,m∈Nr,m\in\mathbb{N} satisfy 2≤r2\le r and 1≤m1\le m. Let GG be a finite simple graph with exactly rmrm vertices and minimum degree at least m(r−1)m(r-1). Prove that there exist mm pairwise disjoint sets of vertices K1,…,KmK_1,\ldots,K_m such that each KiK_i is a clique of size rr.

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.