ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let exr(n;Kr+1r)\mathrm{ex}_r(n;K_{r+1}^r) be the maximum number of rr-edges that can be placed on nn vertices without forming a Kr+1rK_{r+1}^r (the rr-uniform complete graph on r+1r+1 vertices). Is every rr-hypergraph GG on nn vertices the union of at most exr(n;Kr+1r)\mathrm{ex}_{r}(n;K_{r+1}^r) many copies of KrrK_r^r and Kr+1rK_{r+1}^r, no two of which share a KrrK_r^r?", "difficulty": "L1" },{

Record

Added
Links

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.