ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p,q≥1p,q\geq 1 be fixed integers. We define H(n)=H(N;p,q)H(n)=H(N;p,q) to be the largest mm such that any graph on nn vertices where every set of pp vertices spans at least qq edges must contain a complete graph on mm vertices. Is c(p,q)=lim inf⁡log⁡H(n)log⁡nc(p,q)=\liminf \frac{\log H(n)}{\log n} a strictly increasing function of qq for 1≤q≤(p−12)+11\leq q\leq \binom{p-1}{2}+1?

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.